quick algorith java code example
Example: quick sort code in java
import java.util.*;
class QuickSort {
int partition(int intArray[], int low, int high) {
int pi = intArray[high];
int i = (low-1);
for (int j=low; j<high; j++) {
if (intArray[j] <= pi) {
i++;
int temp = intArray[i];
intArray[i] = intArray[j];
intArray[j] = temp;
}
}
int temp = intArray[i+1];
intArray[i+1] = intArray[high];
intArray[high] = temp;
return i+1;
}
void quick_sort(int intArray[], int low, int high) {
if (low < high) {
int pi = partition(intArray, low, high);
quick_sort(intArray, low, pi-1);
quick_sort(intArray, pi+1, high);
}
}
}
class QUICK_SORT{
public static void main(String args[]) {
int intArray[] = {3,2,1,6,5,4};
int n = intArray.length;
System.out.println("Original Array: " + Arrays.toString(intArray));
QuickSort obj = new QuickSort();
obj.quick_sort(intArray, 0, n-1);
System.out.println("\nSorted Array: " + Arrays.toString(intArray));
}
}