public void maxheap(int i){ 
		left=2*i;
		right=2*i+1;
		if(left <= n && numbers[left] > numbers[i]){
			largest=left;
		}
		else{
			largest=i;
		}

		if(right <= n && numbers[right] > numbers[largest]){
			largest=right;
		}
		if(largest!=i){
			exchange(i,largest);
			maxheap(largest);
		}
	}