-
Notifications
You must be signed in to change notification settings - Fork 0
/
QuickSort.java
73 lines (63 loc) · 2.15 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
62
63
64
65
66
67
68
69
70
71
72
73
package DSAalgorithm;
import java.util.Scanner;
class Quick_sort1{
// Swap method to exchange elements in the array
public static void swap(int[] arr, int a, int b) {
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
// Partition method for quicksort
public static int partition(int[] arr, int lb, int ub) {
// Use the first element as the pivot
int pivot = arr[lb];
int start = lb;
int end = ub;
while (start <= end) {
// Move the start pointer to the right until an element greater than pivot is found
while (arr[start]<=pivot)
{
start++;
}
// Move the end pointer to the left until an element less than or equal to pivot is found
while (arr[end] > pivot)
{
end--;
}
// Swap elements if start is still less than end
if (start <= end) {
swap(arr, start, end);
}
}
// Swap the pivot element to its correct position
swap(arr, lb, end);
return end;
}
// QuickSort method
public static void quick_sort(int[] arr, int lb, int ub) {
if (lb < ub) {
int loc = partition(arr, lb, ub);
quick_sort(arr, lb, loc - 1); // Recursively sort the left part
quick_sort(arr, loc + 1, ub); // Recursively sort the right part
}
}
}
public class QuickSort {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of the array:");
int size = sc.nextInt();
int arr[] = new int[size];
System.out.println("Enter the elements of the array:");
for (int i = 0; i < arr.length; i++) {
arr[i] = sc.nextInt();
}
// Call quick_sort on the array
Quick_sort1.quick_sort(arr, 0, size - 1);
System.out.println("Sorted Array is:");
for (int i : arr) {
System.out.println(i);
}
sc.close();
}
}