Register

Time complexity

15,996 views
0 votes
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
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Rackson asked Jan 12, 2019
953 views
Algorithms Time complexity
User Avatar
0 votes
0 votes
1 answer
2
srestha asked Nov 21, 2018
1,974 views
Programming (Time Complexity)
What will be time complexity: main() { int sum=0; for(int bound=1;bound<=n;bound*=2) { for(int i=0;i<bound;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(int j=1;j<n;j*=2) { sum*=j; } } } } I think every for loop is participating to find T.C. something*2 means why will it run upto $log n$ and not upto $\frac{n}{2}$
What will be time complexity:main() { int sum=0; for(int bound=1;bound<=n;bound*=2) { for(int i=0;i<bound;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(int j=1;j<n;j*=2) { sum...
User Avatar
0 votes
0 votes
1 answer
3
HeadShot asked Nov 12, 2018
465 views
Time Complexity
Why ? Isnt Option A true using "Binary search"
Why ?Isnt Option A true using "Binary search"
User Avatar
0 votes
0 votes
0 answers
4
sidlewis asked Sep 1, 2018
405 views
Testbook Test Series :Algorithms - TIme Complexity
User Avatar
Link Copied!