- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Sorting | Question 4
Last Updated :
Discuss
Comments
Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).
Quick Sort
Heap Sort
Merge Sort
Insertion Sort
This question is part of this quiz :
Top MCQs on Sorting Algorithms with Answers,Top MCQs on QuickSort Algorithm with Answers,Top MCQs on InsertionSort Algorithm with Answers,Top MCQs on HeapSort Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
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