counting sort for collections of u32 O(n + maxval) in time, where maxval is the biggest value an input can possibly take
(arr: &mut [u32], maxval: usize)
source not stored for this graph (policy: none)
no outgoing calls