public class Main {
public static void quickSort(int[] arr, int begin, int end) {
if (begin >= end) {
return;
}
int tmp = arr[begin];
int i = begin;
int j = end;
while (i != j) {
while (arr[j] >= tmp && j > i) {
j--;
}
while (arr[i] <= tmp && j > i) {
i++;
}
if (j > i) {
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
arr[begin] = arr[i];
arr[i] = tmp;
quickSort(arr, begin, i - 1);
quickSort(arr, i + 1, end);
}
public static void main(String[] args) {
int[] arr = {5, 2, 9, 3, 6};
int length = arr.length;
System.out.println("Original Array:");
for (int num : arr) {
System.out.print(num + " ");
}
quickSort(arr, 0, length - 1);
System.out.println("\nSorted Array:");
for (int num : arr) {
System.out.print(num + " ");
}
}
}