docs: public static int[] sampleWithoutReplacement(int sampleSize, int n) {
          // This implements a modified form of the genshuf() function from
          // Programming Pearls pg. 129.
          
          // TODO: Design a faster method that only generates min(m, n-m) integers.
          
          int[] array = IntSort.getIndexArray(n);
          for (int i=0; i<sampleSize; i++) {
              int j = Prng.nextInt(n - i) + i;
              // Swap array[i] and array[j]
              int tmp = array[i];
              array[i] = array[j];
              array[j] = tmp;
          }
          return Arrays.copyOf(array, sampleSize);
      }