We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Counting Sort 2
  5. Discussions

Counting Sort 2

  • emhhacker
     + 0 comments

    My Java solution with o(n) time complexity and o(n) space complexity:

    public static List<Integer> countingSort(List<Integer> arr) {
        int[] freqArr = new int[100];
        arr.forEach(num -> freqArr[num]++);

        return IntStream.range(0, 100)
            .boxed()
            .flatMap(i -> Collections.nCopies(freqArr[i], i).stream())
            .collect(Collectors.toList());
    }