Which of the following is not a stable sorting algorithm?Insertion sort Selection sort Bubble sortMerge sort

Selection sort is not a stable sorting algorithm.

Selection sort is not a stable sorting algorithm.

The sorting algorithm among the options provided that is not stable is the Selection Sort.

Here's why:

1. Insertion Sort: This is a stable sorting algorithm because it maintains the relative order of equal elements. If two elements are equal, the order they appear in the sorted output is the same as the order they appeared in the input.

2. Selection Sort: This is not a stable sorting algorithm. During the sorting process, it scans the entire list and selects the smallest element, swapping it with the first unsorted element. This can change the relative order of equal elements.

3. Bubble Sort: This is a stable sorting algorithm. It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

4. Merge Sort: This is a stable sorting algorithm. It divides the unsorted list into n sublists, each containing one element (a list of one element is considered sorted), and repeatedly merges sublists to produce new sorted sublists until there is only one sublist remaining.

Selection sort is not a stable sorting algorithm.