last picture is the question. the rest is material needed

Description Classical sorting algorithms are algorithms rearrange the input list to a certain order defined by the comparison function. For some special domain (in most case, subdomain of natural numbers), we can design special sorting algorithms that working without generalized comparison functions, respectively, non-comparison sorting algorithms. Instance: a list of non-negative integers A = (ay, ay, ..., an) that for all 1 sisno si 0) { --p: baser: } int count[r], B[n], m = 0; for (int j = 0; j