Sort a slice using bucket sort algorithm. Time complexity is `O(n + k)` on average, where `n` is the number of elements, `k` is the number of buckets used in process. Space complexity is `O(n + k)`, as it sorts not in-place.
(arr: &[usize])
source not stored for this graph (policy: none)