Bubble Sort: A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Merge Sort: A divide-and-conquer sorting algorithm that recursively divides the list into smaller sublists until reaching individual elements, then merges them back together in sorted order.
Selection Sort: An in-place comparison-based sorting algorithm where the smallest element is selected and swapped with the first element, then repeating this process on the remaining unsorted portion.