Algorithm type: Sorting algorithm
Can work in-place: No
Stable: Yes
Time complexity: O(K + n); K ≙ number of occupied buckets

function sort(a: List)
   buckets: 
end function

© Marc Auberer 2020