Computer Science and Engineering › Sorting algorithm › Question #5696
Single Choice Easy

QWhich of the following sorting algorithms is stable?

ID: #5696 Sorting algorithm 173 views
Question Info
#5696Q ID
EasyDifficulty
Sorting algorithmTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A Selection sort ✔ ✖
  • B Quick sort ✔ ✖
  • C Insertion sort ✔ ✖
  • D Heap sort ✔ ✖
Correct Answer

Explanation

Insertion sort is a stable sorting algorithm, meaning that it preserves the relative order of equal elements in the sorted output. When two elements have equal keys, their original order is maintained after sorting. In contrast, selection sort, quick sort, and heap sort do not guarantee this property.

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

Which of the following sorting algorithms is not a comparison-based algorithm?... What is a sorting algorithm?... Which of the following sorting algorithms is often used as a subroutine in other sorting algorithms?... What is the time complexity of the best sorting algorithms?... Which of the following sorting algorithms works by repeatedly selecting the minimum element from the unsorted part of the array and putting it at the beginning of the sorted part?... Which of the following is a comparison-based sorting algorithm?... Which of the following sorting algorithms is not an in-place algorithm?... Which of the following sorting algorithms has the worst time complexity for most inputs?... Which of the following sorting algorithms has the best worst-case time complexity?...