Select the correct answerWhich of the given sorting algorithms is not stable?OptionsCounting sortInsertion sortBubble sortSelection sort

Break Down the Problem

1. Identify the stability of each sorting algorithm listed.
2. Analyze which algorithm is not stable.

Relevant Concepts

1. Stable Sorting Algorithms: A sorting algorithm is considered stable if it maintains the relative order of records with equal keys (i.e., duplicates).

2. Algorithms to Evaluate:

   • Counting Sort
   • Insertion Sort
   • Bubble Sort
   • Selection Sort

Analysis and Detail

1. Counting Sort: This algorithm is stable since it maintains the order of equal elements.

2. Insertion Sort: This algorithm is stable as it does not change the relative order of items with equal keys.

3. Bubble Sort: This is also a stable algorithm since equal elements retain their original order after sorting.

4. Selection Sort: This algorithm is not stable. During the selection process, it can swap unequal elements and thus change the order of equal elements.

Verify and Summarize

After analyzing each algorithm, we can confirm that Counting Sort, Insertion Sort, and Bubble Sort are stable, while Selection Sort is not.

Final Answer

Selection Sort is not a stable sorting algorithm.