package com.array;

 public class Sort_Quick {

     /*

      * 项目名称：快速排序 ;

      * 项目要求：用JAVA对数组进行排序，并运用快速排序算法;

      * 作者：Sevck;

      */

     public void sort(int left, int right, int array[]) {

         int l = left;

         int r = right;

         int pirot = array[(left + right) / 2];

         int temp = 0;

         while (l < r) {

             while (array[l] < pirot && l >= left)

                 l++;

             while (array[r] > pirot && r <= right)

                 r--;

             if (l >= r)

                 break;

             temp = array[l];

             array[l] = array[r];

             array[r] = temp;

         }

         if (l == r) {

             l++;

             r--;

         }

         if (left < r)

             sort(left, r, array);

         if (right > l)

             sort(l, right, array);

     }

     public static void main(String[] args) {

         int arr1[] = { 7, 3, 2, 9, 15, 1, 14 };

         Sort_Quick qs = new Sort_Quick();

         qs.sort(0, arr1.length - 1, arr1);

         System.out.println("The current array is:");

         for (int i = 0; i < arr1.length; i++) {

             System.out.print("  " + arr1[i]);

         }

     }

 }