Sorting is a fundamental concept in computer science. Here, we explore different sorting techniques and their efficiency.
A straightforward approach that repeatedly compares adjacent pairs and swaps them if out of order.
Inserts each new element into its correct position, one at a time, making it efficient for small or nearly sorted data.
Systematically selects the smallest element from the unsorted part and places it in the correct spot.
A divide-and-conquer strategy: split the list, sort each half, then merge them back in order.
Uses a pivot to partition the array, placing smaller elements on one side and larger on the other.
Processes numbers digit by digit, distributing them into buckets to handle large sets efficiently.
Groups elements into multiple buckets, sorts each bucket, then merges them for a final sorted list.