DSA8_QuickSort.java

import java.util.Arrays;

public class DSA8_QuickSort {
    public static void main(String[] args) {
        int [] arr = {5,6,2,7,3,8,1};
        sort(arr, 0, arr.length-1);
        System.out.println(Arrays.toString(arr));
        

    }

    static void sort (int arr [] ,int low ,int high){
        if (low >= high){
            return;
        }

        int s = low;
        int e = high ;
        int m = s + (e - s) / 2  ;
        int pivot = arr[m];

        while (s <= e){
            while(arr[s] < pivot){
                s++;
            }
            while (arr[e] > pivot){
                e--;
            }

            if (s <= e){
                int temp = arr[s];
                arr[s] = arr[e];
                arr[e] = temp;
                s++;
                e--;
           }
        }

        sort(arr, low, e);
        sort(arr, s, high);
    }
}