Question 61
Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general?
Heap Sort
Selection Sort
Insertion Sort
Merge Sort
There are 61 questions to complete.