public void heapTheArray(int index){
		int largestChild;
		String root = heapArray[index];
		while(index < items/2){
			int leftChild = 2 * index + 1;
			int rightChild = leftChild + 1;
			if(rightChild < items && Integer.parseInt(heapArray[leftChild]) < Integer.parseInt(heapArray[rightChild]))
				largestChild = rightChild;
			else
				largestChild = leftChild;
			if(Integer.parseInt(root) >= Integer.parseInt(heapArray[largestChild]))
			break;
			heapArray[index] = heapArray[largestChild];
			index = largestChild;
		}
		heapArray[index] = root;
	}