QuickSort Implementation

📝 Description

Implement the QuickSort algorithm to sort an array in ascending order

Input Format

[a1, a2, ..., an] (array of integers)

Output Format

[sorted array]

Constraints

1 ≤ n ≤ 10^5, -10^9 ≤ ai ≤ 10^9

🔍 Sample Input

[5, 2, 9, 1, 5, 6]
            

✅ Sample Output

[1, 2, 5, 5, 6, 9]