public static void quickSort(int[] list, int lo0, int hi0)
    {
    	//algorithm
    	int low=lo0;
    	int high=hi0;
    	int pivot = list[(high+low)/2];
    	list[(low + high)/2]=list[high];
    	list[high]=pivot;
    	
    	while(low<high)
    	{
    		while(low<high && list[low]<=pivot)
    		{
    			low++;	
    		}
    		while(low<high && list[high]>=pivot)
    		{
    			high--;
    		}
    		if(low<high)
    		{
    			int temp = list[low];
    			list[low]=list[high];
    			list[high]=temp;
    		}
    	}
  
    	quickSort(list, lo0, low-1);
    	quickSort(list, high+1, hi0);
    }