Register

Mimimum number of comparison to sort 13 elements/numbers for any comparison based sorting algorithm?

850 views
1 votes
1 votes

I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sort

Also see this link – https://gateoverflow.in/32948/minimum-number-of-comparisons

https://gateoverflow.in/95725/algorithm-minimum-comparison-sorting#a95826

 

Even Wikipedia gives 2 answers as 33 and 34. So, which one is correct? And how 34 is coming?

 

Yes 33 comparison are coming from   but how can one say 34 comparison.

User Avatar

1 Answer

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

Related questions

4 votes
4 votes
2 answers
1
worst_engineer asked Oct 7, 2015
6,073 views
In quick sort , for sorting n elements , the (n/4)th smallest element
In quick sort , for sorting n elements , the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What will be the time complexity? it is $\Theta (n^{2})$ , right ?
In quick sort , for sorting n elements , the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What will be the time complexity?it is $\Theta (...
User Avatar
0 votes
0 votes
1 answer
2
saurabh rai asked Nov 13, 2016
775 views
mimimum no of comparison
Minimum no of comparison to find minimum element out of n elements.
Minimum no of comparison to find minimum element out of n elements.
User Avatar
2 votes
2 votes
1 answer
3
GateMaster Prime asked Dec 28, 2014
1,264 views
Best algorithm in terms of time to sort numbers within range 1 to n^5
User Avatar
19 votes
19 votes
8 answers
4
piyushkr asked Dec 30, 2015
43,621 views
Minimum number of comparisons required to sort 5 elements is
The minimum number of comparisons required to sort 5 elements is - 4 5 6 7
The minimum number of comparisons required to sort 5 elements is -4567
User Avatar
Link Copied!