Sorting isn't just about comparing numbers. There are special sorting methods that work differently. Here are three of them: Counting Sort, Radix Sort, and Bucket Sort.

1. Counting Sort:

   • This method counts how many times each number shows up.
   • For example, if you have the list [4, 2, 2, 8], the algorithm counts the numbers.
   • It keeps track of how many 2s, 4s, and 8s there are.
   • Then, it puts them together in order to create a sorted list.

2. Radix Sort:

   • This method looks at numbers one digit at a time, starting with the last digit.
   • Take the number 321. First, it sorts by the units place (the last digit).
   • Next, it sorts by the tens place (the middle digit), and finally by the hundreds place (the first digit).
   • This process helps put the entire list in order.

3. Bucket Sort:

   • This method groups numbers into “buckets” based on their values and then sorts those buckets.
   • For example, if we have the list [0.23, 0.25, 0.5], it puts these numbers into buckets according to their ranges.
   • After that, it sorts the numbers inside each bucket.

These sorting methods are really good for certain types of data. They can sort things quickly, sometimes in just $O(n)$ time, which is super efficient!