1. How can we check array bounds in this example?

int[] array = {10, 100, 1, 50, 20,30}; int arrayLength = array.length; quickSort(array, 0, arrayLength - 1); System.out.println("Sorted array: "); for (int i = 0; i < arrayLength; i++) { System.out.print(array[i] + " "); }

2. How we can minimize the use of recursion? any alterrnetives?

static void quickSort(int[] arr, int low, int high) { int pivot = arr[high];

int i = (low - 1);

for (int j = low; j <= high - 1; j++) {

if (arr[j] < pivot) { i++; swap(arr, i, j); } } swap(arr, i + 1, high);

if (low < high) { quickSort(arr, low, high - 1); quickSort(arr, low + 1, high); } }