Answer Posted / wonder surong

These terms are found in Recursion.
1.Base Case:it is the case in recursion where the answer is
known,or we can say the termination condition for a
recursion to unwind back.
For example to find Factorial of num using recursion:

int Fact(int num){

if(num==1 || num==0)//base case
return 1;
else // recursive case:
return num*Fact(num-1);
}

2.Recursive case:It is the case whcih brings us to the
closer answer.

Run Time Stack:It is a system stack us to save the frame
stack of a function every recursion or every call.
This frame stack consists of the return address,local
variables and return value if any.

Tail Recursion:The case where the function consist of
single recursive call and it is the last statement to be
executed.A tail Recursion can be replace by iteration.
The above funtion consists of tail recursion case.
where as the below function does not.

void binary(int start,int end,int el){
int mid;
if(end>start){
mid=(start+end)/2;
if(el==ar[mid])
return mid;
else{
if(el>ar[mid])
binary(mid+1,end,ele);
else
binary(start,mid-11,ele);
}
}
}

Why would you use a linked list?

881

---

Compare Queue and Topic ?

1073

---

Why quicksort is faster?

816

---

What is the most used data structure?

871

---

What is dequeue operation?

922

---

What are different types of sorting algorithms?

940

---

Which is best array or linked list?

868

---

What is the difference between a hashmap and hashtable?

791

---

Explain Array of pointers?

943

---

Questions related to arrays, such as given a 2 integer array, find the common elements.

892

---

Can tuple be sorted?

890

---

Does arraylist allow null values?

907

---

Write the importance of hashing?

993

---

How do you find a string is anagram or not?

878

---

How do you sort a collection in descending order?

882

---