Those who cannot remember the past are condemned to repeat it.
Quick-sort
Introduction
Code
publicstaticvoidmain(String[]args){int[]arr={10,7,8,9,1,5};intn=arr.length;quickSort(arr,0,n-1);printArray(arr,n);}// A utility function to swap two elementsstaticvoidswap(int[]arr,inti,intj){inttemp=arr[i];arr[i]=arr[j];arr[j]=temp;}/* This function takes last element as pivot, places
the pivot element at its correct position in sorted
array, and places all smaller (smaller than pivot)
to left of pivot and all greater elements to right
of pivot */staticintpartition(int[]arr,intlow,inthigh){// pivotintpivot=arr[high];// Index of smaller element and// indicates the right position// of pivot found so farinti=(low-1);for(intj=low;j<=high-1;j++){// If current element is smaller// than the pivotif(arr[j]<pivot){// Increment index of// smaller elementi++;swap(arr,i,j);}}swap(arr,i+1,high);return(i+1);}/* The main function that implements QuickSort
arr[] --> Array to be sorted,
low --> Starting index,
high --> Ending index
*/staticvoidquickSort(int[]arr,intlow,inthigh){if(low<high){// pi is partitioning index, arr[p]// is now at right placeintpi=partition(arr,low,high);// Separately sort elements before// partition and after partitionquickSort(arr,low,pi-1);quickSort(arr,pi+1,high);}}// Function to print an arraystaticvoidprintArray(int[]arr,intsize){for(inti=0;i<size;i++)System.out.print(arr[i]+" ");System.out.println();}