Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?
A. | Heap sort |
B. | Quick sort |
C. | Insertion sort |
D. | Selection sort |
Answer : B Explanation : |
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |