Which sorting has the same average and worst time complexity?A, QuickB. BubbleC. Merge

  • Interview Candidate
  • 8
  • 1770

Showing Answers 1 - 8 of 8 Answers

poorvi

  • Dec 5th, 2006
 

Its Merge sort having a worst and an average complexity of nlog(n)

  Was this answer useful?  Yes

Nadal

  • Nov 8th, 2008
 

Average time complexity using quick sort is n lgn

Worst case time complexity using quick sort is n^2

Average time complexity using merge sort is n lgn

Worst case time complexity using merge sort is n lgn

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions