QuickSort.java

import java.util.*;

public class QuickSort {
 public static void main(String[] args) {
 int[] arr = { 5, 1, 4, 3, 2, 8 };
 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 mid = s + (e - s) / 2;
 int p = arr[mid];
 while (s <= e) {
 while (arr[s] < p) {
 s++;
 }
 while (arr[e] > p) {
 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);

 }
}