public static void quickSort(int[] height, int[] order, int low, int high){
		if(low<high){
			int pivot=height[order[low]];
			int i=low;
			int j=high+1;
			for(;;){
				while(++i<=high && height[order[i]]>pivot);
				while(height[order[--j]]<pivot);
				if(i>=j) break;
				int tmp=order[i];
				order[i]=order[j];
				order[j]=tmp;
			}
			int tmp=order[low];
			order[low]=order[j];
			order[j]=tmp;
			
			quickSort(height,order,low, j-1);
			quickSort(height,order,j+1,high);
		}
	}