@Test public void performanceTest() { int N = 1000; int[] a = getRandomArray(N, 1, N * N); long st = System.nanoTime(); Assert.assertEquals(false, FourSum.solveInN2(a)); Assert.assertTrue(System.nanoTime() - st < 250l * 1_000_000); N <<= 1; a = getRandomArray(N, 1, N * N); st = System.nanoTime(); Assert.assertEquals(false, FourSum.solveInN2(a)); Assert.assertTrue(System.nanoTime() - st < 1000l * 1_000_000); }
public static boolean solveInN2(int[] a) { return false; }
FourSum { public static boolean solveInN2(int[] a) { return false; } }
FourSum { public static boolean solveInN2(int[] a) { return false; }  }
FourSum { public static boolean solveInN2(int[] a) { return false; }  static boolean solveInN2(int[] a); }
FourSum { public static boolean solveInN2(int[] a) { return false; }  static boolean solveInN2(int[] a);  }