Sorting methods--Quick sort

Recently there's a front-end big God wrote the wrong fast sort, so I'm here to record

The so-called quick sort is divided by the Order of the Division of the continuous recursive array into two parts of the size, and then continue to be divided into two parts of the size

The entire array is ordered in the process of splitting.

More exchange times, fewer iterations, less space

The code is as follows

     Public Static voidFastsort (int[] arr,intLowintHigh ) {        intL=Low ; intH=High ; intp=Arr[low];  while(l<h) {             while(lp) H--; if(l<h) {                inttemp=Arr[h]; ARR[H]=Arr[l]; ARR[L]=temp; L++; }                         while(lp) L++; if(l<h) {                inttemp=Arr[h]; ARR[H]=Arr[l]; ARR[L]=temp; H--; }        }        if(L>low) Fastsort (arr,low,l-1); if(H, high); }

Sorting methods--Quick sort