Method sort

src/class187/Code02_Cobweb1.java:146–160

(int[] key, long[] path, int l, int r)

	}

	public static void sort(int[] key, long[] path, int l, int r) {
		if (l >= r) return;
		int i = l, j = r, pivot = key[(l + r) >> 1];
		while (i <= j) {
			while (key[i] < pivot) i++;
			while (key[j] > pivot) j--;
			if (i <= j) {
				int tmp1 = key[i]; key[i] = key[j]; key[j] = tmp1;
				long tmp2 = path[i]; path[i] = path[j]; path[j] = tmp2;
				i++; j--;
			}
		}
		sort(key, path, l, j);
		sort(key, path, i, r);
	}

	public static int lessThan(int[] arr, int len, int num) {
		int l = 1, r = len, mid, ans = 0;