2022.02.13 - NC002. sort

1. subject

2. Ideas

(1) Quick sort

• The most basic quick sort algorithm .

3. Code

public class Test {
    
    public static void main(String[] args) {
    
    }
}

class Solution {
    
    public int[] MySort(int[] arr) {
    
        sort(arr, 0, arr.length - 1);
        return arr;
    }

    private void sort(int[] arr, int left, int right) {
    
        if (left < right) {
    
            int low = left;
            int high = right;
            int pivot = arr[low];
            while (low < high) {
    
                while (low < high && arr[high] >= pivot) {
    
                    high--;
                }
                arr[low] = arr[high];
                while (low < high && arr[low] <= pivot) {
    
                    low++;
                }
                arr[high] = arr[low];
            }
            arr[low] = pivot;
            sort(arr, left, low - 1);
            sort(arr, low + 1, right);
        }
    }
}