Tail recursion technique in quicksort
The tail recursion technique can be used to optimize the quicksort to further improve the performance of the quicksort. Tail recursion technology is a very commonly used technology. The following is an introduction to tail recursion technology.
Bucket sorting in linear time sorting
Bucket sorting is O(n) time complexity, and does not require additional space O(k) like counting sorting. (O(k) can be very large, much larger than O(n)).