Randomize Quick Sort Code Formating

Author: VibhuKhera123

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

@@ -1,7 +1,18 @@
 package com.thealgorithms.randomized;
 
+/**
+ * This class implements the Randomized QuickSort algorithm.
+ * It selects a pivot randomly to improve performance on sorted or nearly sorted data.
+ */
 public class RandomizedQuickSort {
 
+    /**
+     * Sorts the array using the randomized quicksort algorithm.
+     *
+     * @param arr the array to sort
+     * @param low the starting index of the array
+     * @param high the ending index of the array
+     */
     public static void randomizedQuickSort(int[] arr, int low, int high) {
         if (low < high) {
             int pivotIndex = partition(arr, low, high);
@@ -10,6 +21,14 @@ public static void randomizedQuickSort(int[] arr, int low, int high) {
         }
     }
 
+    /**
+     * Partitions the array around a pivot chosen randomly.
+     *
+     * @param arr the array to partition
+     * @param low the starting index
+     * @param high the ending index
+     * @return the index of the pivot after partitioning
+     */
     private static int partition(int[] arr, int low, int high) {
         int pivotIndex = low + (int) (Math.random() * (high - low + 1));
         int pivotValue = arr[pivotIndex];
@@ -25,10 +44,16 @@ private static int partition(int[] arr, int low, int high) {
         return storeIndex;
     }
 
+    /**
+     * Swaps two elements in the array.
+     *
+     * @param arr the array in which elements are to be swapped
+     * @param i the first index
+     * @param j the second index
+     */
     private static void swap(int[] arr, int i, int j) {
         int temp = arr[i];
         arr[i] = arr[j];
         arr[j] = temp;
     }
-    
 }

src/test/java/com/thealgorithms/randomized/RandomizedQuickSortTest.java

@@ -4,27 +4,41 @@
 
 import org.junit.jupiter.api.Test;
 
+/**
+ * Unit tests for the RandomizedQuickSort class.
+ */
 public class RandomizedQuickSortTest {
+
+    /**
+     * Tests sorting of an array with multiple elements, including duplicates.
+     */
     @Test
-    public void testRandomizedQuickSort() {
+    public void testRandomizedQuickSort_multipleElements() {
         int[] arr = {3, 6, 8, 10, 1, 2, 1};
-        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         int[] expected = {1, 1, 2, 3, 6, 8, 10};
+        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         assertArrayEquals(expected, arr);
     }
+
+    /**
+     * Tests sorting of an empty array.
+     */
     @Test
-    public void testRandomizedQuickSortEmptyArray() {
+    public void testRandomizedQuickSort_emptyArray() {
         int[] arr = {};
-        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         int[] expected = {};
+        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         assertArrayEquals(expected, arr);
     }
+
+    /**
+     * Tests sorting of an array with a single element.
+     */
     @Test
-    public void testRandomizedQuickSortSingleElementArray() {
+    public void testRandomizedQuickSort_singleElement() {
         int[] arr = {5};
-        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         int[] expected = {5};
+        RandomizedQuickSort.randomizedQuickSort(arr, 0, arr.length - 1);
         assertArrayEquals(expected, arr);
     }
-
 }