Is it possible to combine these two methods? and using while loop instead of recursion?

static int partition(int[] arr, int low, int high) {

// pivot 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); return (i + 1); }

static void quickSort(int[] arr, int low, int high) { if (low < high) {

int pi = partition(arr, low, high); quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); } }