 Each input is then counted by incrementing the value of its corresponding bin.Afterward, the counting array is looped through to arrange all of the inputs in order.This sorting algorithm often cannot be used because "S" needs to be reasonably small for the algorithm to be efficient, but it is extremely fast and demonstrates great asymptotic behavior as "n" increases.