What are the 4 sorting algorithms?

Selection sort, another straightforward approach, works by finding the minimum (or maximum) element in the unsorted portion of the list, swapping it with the leftmost element, and moving the sublist boundaries one step to the right.

Merge sort, a more efficient algorithm, divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves. This divide-and-conquer strategy ensures a logarithmic number of passes through the data.

QuickSort, renowned for its speed, employs a partitioning strategy. It selects an element as a pivot and rearranges the array so that all elements smaller than the pivot come before it, and all elements larger than the pivot come after it. This process is recursively applied to the sub-arrays.

In the realm of Computer Science, mastering CORE algorithms is paramount. Among these, four stand out as essential tools in every programmer's arsenal.

Bubble sort, one of the most basic sorting algorithms, operates by repeatedly stepping through the list, comparing adjacent elements, and swapping them if they are in the wrong order. This process is repeated until the list is sorted.