public class hellojava{
public static void Main (string[] args) {
int[] arr1 = new int[] {45,40,90,30,80,70,50};
System.out.println ("Before sorting:");
for (int i=0; i<arr1.length; i++) {
System.out.print (arr1[i]+ "");
}
System.out.println ();
System.out.println ("After quick sorting:");
QuickSort (arr1, 0, arr1.length-1);
int[] arr2 = new int[] {11,52,4,5,65,4,2,1,45};
System.out.println ("Before sorting:");
for (int i=0; i<arr2.length; i++) {
System.out.print (arr2[i]+ "");
}
System.out.println ();
System.out.println ("After quick sorting:");
QuickSort (arr2, 0, arr2.length-1);
}
private static int partition (int[] array, int low, int. high) {
int temp = Array[low];
while (Lowwhile (Low < high && Array[high] >= temp)
high--;
Array[low] = Array[high];
while (Low < high && Array[low] <= temp)
low++;
Array[high] = Array[low];
}
Array[low] = temp;
return low;
}
public static void QuickSort (int[] Array, int. Low, int.) {
if (Low < high) {
int PA =partition (array, low, high);
for (int i=0; i<array.length; i++) {
System.out.print (array[i]+ "");
}
System.out.println ("+" returns the pivot element position: "+pa");
QuickSort (array, low, pa-1);
QuickSort (array, pa+1, high);
}
}
}
Fast sorting algorithm (Java implementation)