public final static void quickSort(NodeProxy[] list, int low, int high) {
private final static void quickSort(NodeProxy[] list, int low, int high) {
	public final static void quickSort(NodeProxy[] list, int low, int high) {		if (low >= high)			return;		int left_index = low;		int right_index = high;		NodeProxy pivot = list[(low + high) / 2];		NodeProxy temp;		do {			while (left_index <= high && list[left_index].compareTo(pivot) < 0)				left_index++;			while (right_index >= low				&& list[right_index].compareTo(pivot) > 0)				right_index--;			if (left_index <= right_index) {				if (list[left_index].compareTo(list[right_index]) == 0) {					left_index++;					right_index--;				} else {					temp = list[right_index];					list[right_index--] = list[left_index];					list[left_index++] = temp;				}			}		}		while (left_index <= right_index);		quickSort(list, low, right_index);		quickSort(list, left_index, high);	}