Class RadixSort


public class RadixSort extends Object
Sorts the specified list of integers into ascending order using the Radix Sort method. This algorithms runs in $O(N + V)$ time and uses $O(N + V)$ extra memory, where $V = 256$. If $N \leq RadixSort.CUT\_OFF$ then the standard Java sorting algorithm is used. The specified list must be modifiable, but need not be resizable.
  • Field Details

  • Method Details

    • setCutOff

      public static void setCutOff(int cutOff)
    • sort

      public static void sort(List<Integer> list)
      Sort the given list in ascending order.
      list - the input list of integers