1. A counting sort is a simple way to sort an array of n positive integers that lie between 0 and m, inclusive. You need m+1 counters. Then, making only one pass through the array, you count the number of times each integer occurs in the array. For example, the picture below shows an array of integers that lie between 0 and 4 and the five counters after the counting sort has made its pass through the array. From the counters, you can see that the array contains one 0, three 1s, two 2s, one 3, and three 4s. These counters enable you to determine that the sorted array should look as follow: 0 1 1 1 2 2 3 4 4 4
2. A counting sort is a simple way to sort an array of n positive integers that lie between 0 and m, inclusive. You need m+1 counters. Then, making only one pass through the array, you count the number of times each integer occurs in the array. For example, the picture below shows an array of integers that lie between 0 and 4 and the five counters after the counting sort has made its pass through the array. From the counters, you can see that the array contains one 0, three 1s, two 2s, one 3, and three 4s. These counters enable you to determine that the sorted array should look as follow: 0 1 1 1 2 2 3 4 4 4

 *  * COUNTING SORT  *  **************************************************************/ /**  * Making only one pass through the array, counts the number of times  * each integer occurs in the array. These counts are then used  * to sort the array  *  * @param a array to be sorted  * @param maxValue the maximum possible value in the array  */ public static void countingSort(int[] a, int maxValue) { //TODO Project 2  } // end countingSort