@Test public void subset() { final Random random = new Random(); for (int i = 1; i <= 1000; ++i) { int[] sub = new int[i]; Combinatorics.subset(1000, sub, random); Assert.assertTrue(isSortedAndUnique(sub), "K: " + i); } }
public static int[] subset(final int n, final int k) { return subset(n, k, RandomRegistry.random()); }
Combinatorics { public static int[] subset(final int n, final int k) { return subset(n, k, RandomRegistry.random()); } }
Combinatorics { public static int[] subset(final int n, final int k) { return subset(n, k, RandomRegistry.random()); } private  Combinatorics(); }
Combinatorics { public static int[] subset(final int n, final int k) { return subset(n, k, RandomRegistry.random()); } private  Combinatorics(); static int[] subset(final int n, final int k); static int[] subset(final int n, final int k, final Random random); static int[] subset(final int[] set, final int k); static int[] subset(final int[] set, final int k, final Random random); static int[] subset(final int n, final int[] sub); static int[] subset(final int n, final int[] a, final Random random); static void checkSubSet(final int n, final int k); }
Combinatorics { public static int[] subset(final int n, final int k) { return subset(n, k, RandomRegistry.random()); } private  Combinatorics(); static int[] subset(final int n, final int k); static int[] subset(final int n, final int k, final Random random); static int[] subset(final int[] set, final int k); static int[] subset(final int[] set, final int k, final Random random); static int[] subset(final int n, final int[] sub); static int[] subset(final int n, final int[] a, final Random random); static void checkSubSet(final int n, final int k);  }