Question

Consider following statements about time complexity :
A. Merge sort and heap sort have $O(n \log n)$ in worst case

B. Quick sort has $O(n \log n)$ in average case and $O(n^2)$ in worst case

C. Insertion sort is faster than merge sort for large $n$

D. Bubble sort is stable

E. Selection sort has fewer swap than insertion sort

Choose the correct answer from the options given below :

• A. B, C, E only
• B. A, C, D only
• C. A, B, C only
• D. A, B, D, E only

Hint:

Selection sort is the best choice when the cost of "swapping" memory is very high, because it minimizes the total number of swaps.

Answer 1

The Correct Option is D