undefined

/** * replacement mainfor QuickFindur.java * Given a set of n = 64 objects * Test Quickfindup in three different ways and print the results * Test 1(a): u(0, 1), u(1, 2), u(2, 3) ... (62, 63) * Test 1(b): u(0, 63), (1, 63), u(2, 63) ... (62, 63) * Test 1(c): Merge into 16 subsets each of size 4, then 4 subsets each of size 16, then one subset of all 64 elements */ public static void main(String[] args) { int n = 64; QuickFindur uf = new QuickFinduf(n); for (int k = 0; k