public static void maxheap(int array[], int i) {
		int left = 2 * i;
		int right = 2 * i + 1;
		int parent = i;
		if (left <= N && array[left] > array[i])
			parent = left;
		if (right <= N && array[right] > array[parent])
			parent = right;
		if (parent != i) {
			swap(array, i, parent);
			maxheap(array, parent);
		}
	}