package Sort;

public class QuickSort {
    static final int SIZE=10;
        public static void quick(int[] arr, int start, int end) {        
                
           int low = start;   
           int high = end;    
           int pivot = arr[low];      
           while (low < high) {       
           while (low < high && arr[high] >= pivot) {       
               high--;            
               }   
           arr[low] = arr[high];
           while (low < high && arr[low] <= pivot) {     
               low++;       
               }           
           arr[high] = arr[low]; 
           }
           arr[low] = pivot;   
           if (end <= start)
           {          
              return; 
           }    
      quick(arr, start, low - 1); 
      quick(arr, low + 1, end); 
      }     
    public static void main(String[] args) {
        int[] array=new int[SIZE];
        int i;
        for (i=0;i<SIZE;i++) 
        {
            array[i]=(int)(100+Math.random()*(100+1));
        }
        System.out.println("the origin array is :");
        for(i=0;i<SIZE;i++)
        {
            System.out.println(array[i]+"");
        }
        quick(array,0,SIZE-1);
        System.out.println("Sorted array :");
        for(i=0;i<SIZE;i++){
            {
                System.out.print(array[i]+"\n");
            }
        }
    }
}