public class ASwap {
public static void main(String[] args) {
int a[] = { 5, 3, 2, 4, 6, 1, 7, 9, 0, 8 };
QuickSort(a, 0, 9);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
private static void QuickSort(int[] a, int left, int right) {
if (left > right)
return;
int i = left;
int j = right;
int pivot = a[left];
while (i != j) {
while (a[j] >= pivot && i < j)
j--;
while (a[i] <= pivot && i < j)
i++;
if (i < j) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
a[left] = a[i];
a[i] = pivot;
QuickSort(a, left, i - 1);
QuickSort(a, i + 1, right);
}
}