• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming
• /
• Technical

DATA STRUCTURE Question Papers:

(#M40019028) DATA STRUCTURE Programming question DATA STRUCTURE QUESTIONS Keep an EYE

Which sort show the best average behavior?

Asked In DATA STRUCTURE (11 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (4)   (1) Submit Your Solution Technical

Read Solution (8) :

arthi  (10 years ago)

quick sort

Is this solution Helpfull? Yes (6) | No (4)  

Naga Venkata Satyanarayana Gontla  (10 years ago)

merge sort (o(nlogn) in all cases

Is this solution Helpfull? Yes (1) | No   

varun kumar  (9 years ago)

Quick Sort because it is fast and takes less time to sort.

Is this solution Helpfull? Yes (1) | No (1)  

ATUL BHASKAR  (9 years ago)

For this ques. quick, merge, heap sort all are correct.... But out of these Heap sort has best efficiency over all, as
For QUICK SORT: Best case and Avg. case = o(nlog n), but worst case is o(n^2).
For Merge SORT : Avg. Case and worst case = o(nlog n), but best case is o(nlog n) or o(n).
For HEAP SORT : Worst case and Avg. case = o(nlog n), but best case is o(nlog n) or omega(n).

Is this solution Helpfull? Yes (1) | No   

aprajitasingh  (10 years ago)

miss arati can u explain why the answer is quich sort

Is this solution Helpfull? Yes | No   

sanchari samaddar  (9 years ago)

merge sort.. runtime o(nlogn)

Is this solution Helpfull? Yes | No   

RITI CHOUBEY  (9 years ago)

merge sort shows best behavior because of having less time complexity.i.e. o(nlogn)

Is this solution Helpfull? Yes | No   

jyoti pandey  (9 years ago)

quick is best

Is this solution Helpfull? Yes | No   

Please Login to Read Solution.