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);
}
}
}

How does shell sort work?

934

---

Explain what is linear search?

969

---

Which data structures are used in bfs and dfs algorithm?

1043

---

Define an abstract data type (adt)?

973

---

What is adt and its advantages?

1028

---

What is meant by strongly connected in a graph?

923

---

Is heap sort stable?

879

---

What is dequeue in data structure?

909

---

Are the expressions arr and &arr same for an array of integers?

1005

---

What is arrays copyof?

871

---

do records fall under linear or non linear data structures?

1738

---

What is data structure and its types?

917

---

Why do we need to use computers to help us sort lists?

933

---

How many parts are there in a declaration statement using data structures?

996

---

What you mean by sorting?

925

---