Java
xxxxxxxxxx
import java.util.Arrays;
class Quicksort {
static int partition(int array[], int low, int high) {
int pivot = array[high];
int i = (low - 1);
for (int j = low; j < high; j++) {
if (array[j] <= pivot) {
i++;
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
int temp = array[i + 1];
array[i + 1] = array[high];
array[high] = temp;
return (i + 1);
}
static void quickSort(int array[], int low, int high) {
if (low < high) {
int pi = partition(array, low, high);
quickSort(array, low, pi - 1);
quickSort(array, pi + 1, high);
}
}
}
class Main {
public static void main(String args[]) {
int[] data = { 8, 7, 2, 1, 0, 9, 6 };
System.out.println("Unsorted Array");
System.out.println(Arrays.toString(data));
int size = data.length;
Quicksort.quickSort(data, 0, size - 1);
System.out.println("Sorted Array in Ascending Order ");
System.out.println(Arrays.toString(data));
}
}
Unsorted Array [8, 7, 2, 1, 0, 9, 6] Sorted Array in Ascending Order [0, 1, 2, 6, 7, 8, 9]
Linux - Jinsi ya kufunga anc-api-tools
Linux - Jinsi ya kufunga curvedns
Python - Angalia kama Nambari ni Chanya, Hasi au 0
Linux - Jinsi ya kufunga zenmap
C - Hesabu Idadi ya Nambari katika Nambari kamili
C++ - Angalia kama Nambari ni Mkuu au La
C++ - Angalia Mwaka wa Leap
JavaScript - Angalia Kama Mfuatano Unaanza na Kuisha na Wahusika fulani
C - Pata Nambari Kubwa Zaidi Kwa Kutumia Ugawaji wa Kumbukumbu Inayobadilika
Linux - Jinsi ya kufunga xbitmaps
Linux - Jinsi ya kufunga zstd
Kotlin - Badilisha Nambari
Kotlin - Zungusha Nambari hadi n Sehemu za Desimali
Java - Badilisha Nambari
Python - Kuandika Faili za Excel (XLSX).
C++ - Tafuta Nukuu na Salio
Java - Unda Piramidi na Muundo
Linux - Jinsi ya kufunga zfs-test
We have been online since 2021 and 1 millions of people around the globe have visited our website since then
More visitors every month