Algorithms | Sorting | Question 6

Last Updated :
Discuss
Comments

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

This question is part of this quiz :

Top MCQs on Sorting Algorithms with Answers,Top MCQs on SelectionSort Algorithm with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy