QuickSortDemo

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

package com.suning.sntcscase.controller.MutiThread;   import static jdk.nashorn.internal.objects.Global.print;   public class QuickSortDemo {       public static void main(String[] args) {         int[] arr = {5, 6, 7, 81, 2, 66, 88, 17, 99};          printArr(arr);         quickSort(arr, 0, arr.length - 1);         System.out.println();         printArr(arr);     }       private static void printArr(int[] arr) {         for(int i=0;i<arr.length; i++){             System.out.print(arr[i] +"\t");         }     }       private static void quickSort(int[] arr, int low, int high) {         int start = low;         int end = high;         int key = arr[low];           //从右往左找小         while (end > start) {               while (end > start && arr[end] >= key)                 end--;               if (arr[end] <= key) {                 int tmp = arr[end];                 arr[end] = arr[start];                 arr[start] = tmp;             }                 //从左往右大             while (end > start && arr[start] <= key)                 start++;                 if (arr[start] >= key) {                 int tmp = arr[start];                 arr[start] = arr[end];                 arr[end] = tmp;             }           }           ///递归      if(start <low)   quickSort(arr,0,start-1);      if(end <high)   quickSort(arr,end+1,high);             }             }