A concise guide to sort algorithms with easy explanations
Bubble Sort
A sorting algorithm that works by repeatedly comparing two elements and swapping them if they are in the wrong order.
Selection Sort
A sorting algorithm that works by iterating over a list of elements and selecting the smallest element to swap with the first element.
Insertion Sort
A sorting algorithm that works by iterating over a list of elements and inserting the largest element into the correct position.
Heap Sort
A sorting algorithm that works by iterating over a list of elements and creating a heap out of the list. The smallest element is then swapped with the first element and the largest element is swapped with the last element.
Merge Sort
A sorting algorithm that works by splitting a list of elements into two lists and then merging the two lists.
Binary Search
A sorting algorithm that works by iterating over a list of elements and searching for the desired element.
Radix Sort
A sorting algorithm that works by iterating over a list of elements and sorting them based on a specific criteria.
Quick Sort
A sorting algorithm that works by partitioning a list of elements into two lists and then sorting the two lists.
Counting Sort
A sorting algorithm that works by counting the number of elements in each list and then sorting the lists based on the counts.
String Sort
A sorting algorithm that works by sorting a list of strings based on their alphabetical order.
Bubble Up Sort
A sorting algorithm that works by sorting a list of elements and then bubbling up the smallest element to the top of the list.