Fast sorting algorithm

Pay attention to understanding the division and recursive thinking, select a base (Dig a pit), from right to left to find a smaller than the base of the exchange, and then from left to right to find a larger than the base to exchange.

Java:

public static void Adjustarray (integer[] arr, int l, int r) {if (L < r) {int i = l, j = r;   int k = Arr[l];    while (I < J) {while (I < J && K < Arr[j]) {j--;    } Arr[i] = Arr[j];    while (I < J && k > Arr[i]) {i++;   } Arr[j] = Arr[i];   } Arr[i] = k;   Adjustarray (arr, L, i-1);  Adjustarray (arr, i + 1, R); } }

Reference:

Sorting algorithm--Quick sort

Fast sorting algorithm