Register

Time complexity

16,939 views
0 0 votes
Which of the following sorting algorithms yield approximately the same worst-case and average case running time behaviour is O(n log n)?

A. Bubble sort and selection sort

B.  Heap sort and merge sort

C. Quick sort and radix sort

D.Tree sort and median-of-3-quick sort

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Kset 2017Next → · M Tech in NITs
← Previous in category · C practice QustionNext in category → · C programming
Position:
Show:

Related questions

0 0 votes
0 0 answers
500
500 views
saket jaiswal asked Jan 18, 2025
500 views
Time complexity question
Q) Find time complexity of this code:int n;int sum;for (int i = 1; i < n; i++) { for (int j = 0; j < i * i; j++) { if (j % i == 0) { ...
0 0 votes
1 1 answer
1.9k
1.9k views
Rackson asked Jan 12, 2019
1,868 views
Algorithms Time complexity