Data Structures, Algorithms, Java, Big O Notation, Searching And Sorting.
character for (int i = 0; i < n; i++) count[arr[i]]++; // Change count[i] so that count[i] now contains // actual position of this character in output array for (int i = 1; i <= 255; i++) count[i] += count[i - 1]; // Build the output character array // To make it stable we are operating in reverse