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