How to avoid my index going out of bounds in quicksort?

@rollin 

One way to avoid your index going out of bounds in quicksort is to always check if your indices are within the bounds of the array before accessing elements. Here are some tips to help prevent index out of bounds errors in quicksort:

1. Make sure to handle the base case: Before partitioning the array in quicksort, check if the left index is less than the right index. If not, simply return from the function to avoid further partitioning on an empty subarray.
2. Update the indices after partitioning: After partitioning the array and recursively calling quicksort on the left and right subarrays, make sure to update the indices accordingly to prevent accessing elements outside the bounds of the array.
3. Use proper boundary checks: When accessing elements in the array or calculating pivots, always check if the indices are within the valid range of the array. For example, when swapping elements, ensure that both indices are within the bounds of the array.
4. Double-check recursive calls: When making recursive calls to quicksort, ensure that the indices passed to the recursive calls are valid and within the bounds of the array. Double-check the condition for the recursive calls to avoid potential index out of bounds errors.

By following these tips and performing proper boundary checks throughout the quicksort algorithm, you can effectively prevent your index from going out of bounds.