Bubble Sort

The bubble sort algorithm is a simple comparison-based sorting algorithm. It repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the entire list is sorted. The key idea behind bubble sort is that, in each pass, the largest (or smallest, depending on the sorting order) element "bubbles" up to its correct position.

Selection Sort

Selection sort is a simple comparison-based sorting algorithm that divides the input list into two parts: a sorted sub list and an unsorted sub list. The algorithm repeatedly selects the smallest element from the unsorted sub list and swaps it with the leftmost unsorted element. This process continues until the entire list is sorted.

Insertion Sort

Insertion sort is a simple comparison-based sorting algorithm that builds the final sorted list one item at a time. It iterates through the list, selecting one element at a time and inserting it into its correct position within the sorted sublist. The algorithm maintains a sorted sublist to the left of the current position, which grows as each element is inserted.

Quick Sort

Quick Sort is a widely used comparison-based sorting algorithm that follows the divide-and-conquer paradigm. It works by selecting a pivot element from the array and partitioning the other elements into two subarrays, according to whether they are less than or greater than the pivot. The process is recursively applied to the subarrays until the entire array is sorted.

Merge Sort

Merge Sort is a popular comparison-based sorting algorithm that follows the divide-and-conquer approach. It divides the input array into two halves, recursively sorts each half, and then merges the sorted halves to produce a sorted output. The algorithm takes advantage of the fact that it is easier to merge two sorted arrays into a single sorted array.