public void maxHeapify(int i){
		if(i>=contents.length) return;
		int left=left(i);
		int right=right(i);
		if(left==-1) return;
		if(right==-1){
			if(contents[i]<contents[left]){
				swap(i,left);
			}
			return;
		}
		
		if(contents[i]>=contents[left] && contents[i]>=contents[right]) return;
		
		if(contents[left]<contents[right]){
			//Swap right
			swap(i,right);
			maxHeapify(right);
		}else{
			//Swap left
			swap(i,left);
			maxHeapify(left);
		}
	}