Which sort show the best average behavior?

• quick sort
• 11 years agoHelpfull: Yes(6) No(4)
• merge sort (o(nlogn) in all cases
• 11 years agoHelpfull: Yes(1) No(0)
• Quick Sort because it is fast and takes less time to sort.
• 10 years agoHelpfull: Yes(1) No(1)
• 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).
• 10 years agoHelpfull: Yes(1) No(0)
• miss arati can u explain why the answer is quich sort
  
• 10 years agoHelpfull: Yes(0) No(0)
• merge sort.. runtime o(nlogn)
• 10 years agoHelpfull: Yes(0) No(0)
• merge sort shows best behavior because of having less time complexity.i.e. o(nlogn)
• 10 years agoHelpfull: Yes(0) No(0)
• quick is best
• 10 years agoHelpfull: Yes(0) No(0)