2 votes 2 votes The minimum number of comparisons required to sort 25 elements is ____ Algorithms sorting algorithms + – Shivi rao asked Nov 11, 2017 Shivi rao 722 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Mk Utkarsh answered Nov 11, 2017 Mk Utkarsh comment Share Follow See 1 comment See all 1 1 comment reply $ruthi commented Nov 12, 2017 reply Follow Share how can it be log(n!). since name of the sorting not mentioned we can take any of the sorting algo which gives min value right? 0 votes 0 votes Please log in or register to add a comment.