Answer Posted / bipin from utkal university mc

suppose there are five element 23,56,78,12,90
minimum time require means searching element present at
first so it takes only one comparison
maximum time require means searching element present at
last so it takes n No. of comparison(here 5 )

so avarage comarison=(1+n)/2

What is data structure and its classification?

907

---

Is file a data structure?

948

---

There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?

1258

---

Which is better merge or quick sort?

933

---

Is data structures and algorithms important?

917

---

How do you perform a merge sort?

878

---

How can you correct these errors?

964

---

Is queue fifo or lifo?

874

---

How do you create a tree diagram?

989

---

How do you sort a map by key?

838

---

What are the complexity of binary search?

907

---

What is sorting and its types?

1039

---

Which is better bubble sort or selection sort?

809

---

How can I study data structures and algorithms?

950

---

What is the impact of signed numbers on the memory?

922

---