Sorting algorithms are used to arrange a list of elements in a certain order.
Another term that is mostly heard with these sorting algorithms is Stable/Unstable algorithms.
Stable algorithms are those that do not change the position of occurance of similar elements from their previous order.
Most commonly known sorting algorithms are-
- Bubble Sort
- Insertion Sort
- Selection Sort
- quick Sort
- Merge Sort
- Heap sort
- Radix Sort
- Shell Sort
Out of these algorithms Merge sort,quick sort,Heap sort and shell sort algorithms are said to be efficient sorting algorithms with average Big O of (n log n)