-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSortRandom.java
More file actions
69 lines (58 loc) · 2.2 KB
/
Copy pathQuickSortRandom.java
File metadata and controls
69 lines (58 loc) · 2.2 KB
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
package DAA_Practicals;
import java.util.Arrays;
import java.util.Random;
public class QuickSortRandom {
public static void deterministicQuickSort(int[] arr, int low, int high) {
if (low < high) {
int pivot = partition(arr, low, high);
deterministicQuickSort(arr, low, pivot - 1);
deterministicQuickSort(arr, pivot + 1, high);
}
}
public static void randomizedQuickSort(int[] arr, int low, int high) {
if (low < high) {
int pivotIndex = randomizedPartition(arr, low, high);
randomizedQuickSort(arr, low, pivotIndex - 1);
randomizedQuickSort(arr, pivotIndex + 1, high);
}
}
public static int partition(int[] arr, int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] < pivot) {
i++;
swap(arr, i, j);
}
}
swap(arr, i + 1, high);
return i + 1;
}
public static int randomizedPartition(int[] arr, int low, int high) {
Random rand = new Random();
int randomIndex = rand.nextInt(high - low + 1) + low;
swap(arr, randomIndex, high);
return partition(arr, low, high);
}
public static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void main(String[] args) {
int[] arr1 = {1,2,3,4,5,6};
int[] arr2 = Arrays.copyOf(arr1, arr1.length);
System.out.println("Deterministic Quick Sort:");
long startTime = System.nanoTime();
deterministicQuickSort(arr1, 0, arr1.length - 1);
long endTime = System.nanoTime();
System.out.println("Sorted Array: " + Arrays.toString(arr1));
System.out.println("Time taken: " + (endTime - startTime) + " ns");
System.out.println("\nRandomized Quick Sort:");
startTime = System.nanoTime();
randomizedQuickSort(arr2, 0, arr2.length - 1);
endTime = System.nanoTime();
System.out.println("Sorted Array: " + Arrays.toString(arr2));
System.out.println("Time taken: " + (endTime - startTime) + " ns");
}
}