Quote (sylz1014 @ Jan 8 2013 07:45pm)
That helps slightly, although I still don't quite get how it works in the coding part.
e/
I know I'm not explaining myself all to an extent as I should but I'm really tired right now

what part of this do you not understand?
Code
function bucketSort(array, n) is
buckets ← new array of n empty lists
for i = 0 to (length(array)-1) do
insert array[i] into buckets[msbits(array[i], k)]
for i = 0 to n - 1 do
nextSort(buckets[i])
return the concatenation of buckets[0], ...., buckets[n-1]
1. create your buckets
2. assign everything in the array to a bucket
3. sort each bucket
4. combine all the buckets