Add Randomized QuickSort algorithm to sorts

Author: Asitha-S

src/main/java/com/thealgorithms/sorts/RandomizedQuickSort.java

@@ -0,0 +1,50 @@
+import java.util.Random;
+
+public class RandomizedQuickSort {
+
+    private static final Random rand = new Random();
+
+    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);
+        }
+    }
+
+    private static int randomizedPartition(int[] arr, int low, int high) {
+        int pivotIndex = low + rand.nextInt(high - low + 1);
+        swap(arr, pivotIndex, high);  // Move pivot to end
+        return partition(arr, low, high);
+    }
+
+    private static int partition(int[] arr, int low, int high) {
+        int pivot = arr[high];
+        int i = low - 1;  // index of smaller element
+        for (int j = low; j < high; j++) {
+            if (arr[j] <= pivot) {
+                i++;
+                swap(arr, i, j);
+            }
+        }
+        swap(arr, i + 1, high);
+        return i + 1;
+    }
+
+    private static void swap(int[] arr, int i, int j) {
+        int temp = arr[i];
+        arr[i] = arr[j];
+        arr[j] = temp;
+    }
+
+    // Test the algorithm
+    public static void main(String[] args) {
+        int[] arr = {10, 7, 8, 9, 1, 5};
+        randomizedQuickSort(arr, 0, arr.length - 1);
+        System.out.println("Sorted array:");
+        for (int num : arr) {
+            System.out.print(num + " ");
+        }
+    }
+}
+