Bubble Sort
is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.
Selection Sort
sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning.
Insertion sort
is a simple sorting algorithm that works similar to the way you sort playing cards in your hands.
Heap sort
is a comparison-based sorting technique based on Binary Heap data structure.
Merge Sort
algorithm is a sorting algorithm that is based on the Divide and Conquer paradigm.
Counting sort
is a sorting technique based on keys between a specific range.
Radix Sort
is to do digit by digit sort starting from least significant digit to most significant digit.
Quick Sort
is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.