closed by
208 views
0 votes
0 votes
closed with the note: Violation of community guidelines https://gateoverflow.in/blog/2113
#DS
suppose you have an array of 128 elements.which number is closest to the minimum number of binary element comparisons that would be necessary to sort the elements is?
I am getting 896,
as we have 128 elements for each element we take logn comparison because it is unsorted,
but the answer is given 891,
please guide?
closed by

No related questions found