-
Notifications
You must be signed in to change notification settings - Fork 88
/
QuickSort.java
61 lines (51 loc) · 1.72 KB
/
QuickSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
public class QuickSort {
// Method to perform QuickSort
public static void quickSort(int[] arr, int low, int high) {
if (low < high) {
// Partition the array and get the pivot index
int pivotIndex = partition(arr, low, high);
// Recursively sort the elements before and after the partition
quickSort(arr, low, pivotIndex - 1);
quickSort(arr, pivotIndex + 1, high);
}
}
// Method to partition the array
private static int partition(int[] arr, int low, int high) {
// Choose the rightmost element as the pivot
int pivot = arr[high];
int i = low - 1;
// Rearrange the elements based on the pivot
for (int j = low; j < high; j++) {
if (arr[j] <= pivot) {
i++;
// Swap arr[i] and arr[j]
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
// Swap the pivot element with the element at i + 1
int temp = arr[i + 1];
arr[i + 1] = arr[high];
arr[high] = temp;
// Return the index of the pivot element
return i + 1;
}
// Main method to test QuickSort
public static void main(String[] args) {
int[] arr = { 10, 7, 8, 9, 1, 5 };
int n = arr.length;
System.out.println("Unsorted array:");
printArray(arr);
quickSort(arr, 0, n - 1);
System.out.println("Sorted array:");
printArray(arr);
}
// Utility method to print the array
public static void printArray(int[] arr) {
for (int i : arr) {
System.out.print(i + " ");
}
System.out.println();
}
}