Distribution Counting Sort - lends itself well to radix sortfor (j = 0; j <  M; j++) count[j] = 0;              // initialize the count arrayfor (i = 1; i <= N; i++) count[a[i]]++;             // tally frequencies for each value in the target arrayfor (j = 1; j <  M; j++) count[j] += count[j-1];    // accumulate the frequenciesfor (i = N; i >= 1; i--) b[count[a[i]]--] = a[i];   // transfer values to temp arrayfor (i = 1; i <= N; i++) a[i] = b[i];               // transfer values back to the target arraywhere b is a temporary array of N elementswhere M is a limit on the range of the values stored in athat is - the values stored in a range from 0 to M - 1in the fourth loop the accumulated freqency is used as an index into the temp arraybecause the accumulated value indicates the number of values less than the current valuethe accumulated value is decremented, because following the transfer, there is one lessvalue less than the current value. The loop descends in order to keep the sort stable.