Sorting algorithms/Counting sort - Rosetta Code

Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence.

public static void countingSort(int[] array, int min, int max){
 int[] count= new int[max - min + 1];
 for(int number : array){
  count[number - min]++;
 }
 int z= 0;
 for(int i= min;i <= max;i++){
  while(count[i - min] > 0){
   array[z]= i;
   z++;
   count[i - min]--;
  }
 }
}

Also refer to http://en.wikipedia.org/wiki/Counting_sort
http://www.geeksforgeeks.org/counting-sort/
Read full article from Sorting algorithms/Counting sort - Rosetta Code