Sort(n, k, ) if(k <= log_2(n)) { CountSort return } Sort(n, k/2, b_i) Sort(n, k/2, a_i)