Bubble, Selection, and Insertion Sort
These are the three basic, intuitive sorting algorithms. Their time complexity is generally O(n^2), making them inefficient for large datasets, but they are crucial for understanding algorithm mechanics and in-place sorting.
Merge Sort and Quick Sort
These are advanced, highly efficient sorting algorithms based on the Divide and Conquer paradigm.