722 views

1 Answer

0 votes
0 votes

n =25

Minimum number of comparisions = log2(n!)

n! = 15511210043330985984000000

log2(15511210043330985984000000) = 83.68151 

So taking upper bound we get 84

Related questions

0 votes
0 votes
2 answers
2
_Madhuri asked Oct 9, 2021
631 views
The complexity of comparison based sorting algorithm is (nlogn) .How?
1 votes
1 votes
1 answer
4
iarnav asked May 4, 2019
834 views
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...