V tem primeru se bomo naučili izvajati algoritem hitrega razvrščanja v Javi.
Če želite razumeti ta primer, morate poznati naslednje programske teme Java:
- Java metode
- Java za zanko
- Java nizi
Primer: Java program za izvajanje algoritma hitrega razvrščanja
// Quick sort in Java import java.util.Arrays; class Main ( // divide the array on the basis of pivot int partition(int array(), int low, int high) ( // select last element as pivot int pivot = array(high); // initialize the second pointer int i = (low - 1); // Put the elements smaller than pivot on the left and // greater than pivot on the right of pivot for (int j = low; j = pivot) if (array(j) <= pivot) ( // increase the second pointer if // smaller element is swapped with greater i++; int temp = array(i); array(i) = array(j); array(j) = temp; ) ) // put pivot in position // so that element on left are smaller // element on right are greater than pivot int temp = array(i + 1); array(i + 1) = array(high); array(high) = temp; return (i + 1); ) void quickSort(int array(), int low, int high) ( if (low < high) ( // Select pivot position and put all the elements smaller // than pivot on the left and greater than pivot on right int pi = partition(array, low, high); // sort the elements on the left of the pivot quickSort(array, low, pi - 1); // sort the elements on the right of pivot quickSort(array, pi + 1, high); ) ) // Driver code public static void main(String args()) ( // create an unsorted array int() data = ( 8, 7, 2, 1, 0, 9, 6 ); int size = data.length; // create an object of the Main class Main qs = new Main(); // pass the array with the first and last index qs.quickSort(data, 0, size - 1); System.out.println("Sorted Array: "); System.out.println(Arrays.toString(data)); ) )
Izhod 1
Nerazvrščeno polje: (8, 7, 2, 1, 0, 9, 6) Razvrščeno polje: (0, 1, 2, 6, 7, 8, 9)
Tu so elementi polja razvrščeni po naraščajočem vrstnem redu. Če želimo elemente razvrstiti po padajočem vrstnem redu, lahko znotraj zanke for partition()metode spremenimo kodo kot:
// the less than sign is changed to greater than if (array(j)>= pivot) (
Če želite izvedeti več o algoritmu za hitro razvrščanje, obiščite algoritem za hitro razvrščanje.
