1/**
2 * Quick Sort implementation for JavaScript arrays
3 * @param {Array} arr - The array to sort
4 * @returns {Array} - A new sorted array
5 */
6function quickSort(arr) {
7  // Create a copy to avoid modifying the original array
8  const result = [...arr];
9  
10  // Helper recursive function that performs the sorting
11  const sort = (arr, low, high) => {
12    if (low < high) {
13      // Find the partition index
14      const pivotIndex = partition(arr, low, high);
15      
16      // Recursively sort elements before and after the pivot
17      sort(arr, low, pivotIndex - 1);
18      sort(arr, pivotIndex + 1, high);
19    }
20  };
21  
22  // Helper function to partition the array around a pivot
23  const partition = (arr, low, high) => {
24    // Choose the rightmost element as pivot
25    const pivot = arr[high];
26    
27    // Index of smaller element
28    let i = low - 1;
29    
30    // Compare each element with pivot
31    for (let j = low; j < high; j++) {
32      // If current element is smaller than the pivot
33      if (arr[j] < pivot) {
34        i++;
35        // Swap elements
36        [arr[i], arr[j]] = [arr[j], arr[i]];
37      }
38    }
39    
40    // Swap the pivot element with the element at (i+1)
41    [arr[i + 1], arr[high]] = [arr[high], arr[i + 1]];
42    
43    // Return the pivot position
44    return i + 1;
45  };
46  
47  // Call the sorting function on the entire array
48  sort(result, 0, result.length - 1);
49  
50  return result;
51}