|
|
|
|
|
|
by klipt
2344 days ago
|
|
|
In a way, quick sort, radix sort and merge sort are all just recursive versions of bucket sort :-) * Merge sort: sort within buckets, then between buckets * Quick sort: sort between buckets, then within buckets. * Radix sort: can be either depending on whether you sort by most or least significant radix first. Humans can handle dividing into more than 2 at each stage though, so sorting 100 things with 10 piles of 10 tends to be easier than 7 binary divisions. |
|
|