Among the following in-place comparison-based sorting algorithms, which…
PYQ IBPS SO CRP SPL-XIV (2024)
Among the following in-place comparison-based sorting algorithms, which algorithm generally performs the minimum number of swaps in the worst case?
- A.
Bubble Sort
- B.
Quick Sort
- C.
Selection Sort
- D.
Insertion Sort
- E.
Merge Sort
Attempted by 54 students.
Sign up free to check your answer
Sign up freeLoading lesson…

