in Algorithms
1,030 views
3 votes
3 votes
Which of the following algorithms exhibits the unnatural behavior that, minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and maximum number of comparisons are needed if they are already in sorted order?

A) heap sort.      B) Radix sort.    C) Binary insertion sort.    D) There can't be any such sorting method
in Algorithms
by
1.0k views

4 Comments

what is the answer??  @srestha

0
0

@shubham02

d)??

I think binary insertion sort give a better performance in both sorted and reverse sorted order.

1
1
okay...thank u for the reply..☺
0
0

Please log in or register to answer this question.

Related questions