퀵정렬

        //퀵정렬

        public static void quickSort(int[] list, int i_left , int i_right) {

          if(i_left < i_right ) { 

              int left = i_left ;

              int right = i_right ;

              int pivot = list [i_left];

            

              //분할 과정

              while(left < right ) {

                 while(list [right] > pivot ) right --;

                 while(left < right && list[left] <= pivot) left++;

                   int tmp = list [left];

                   list[left] = list[ right];

                   list[right] = tmp;

               }

               list[i_left] = list[left];

               list[left] = pivot;

             

               //정렬 과정

               quickSort(list, i_left, left-1);

               quickSort(list, left+1, i_right);

            }

       }