How to implement this Merge Sort algorithm using data Structures(stack, queue)?

static int partition(int arr[], int left, int right)

{
int i = left, j = right;

int tmp;

int pivot = arr[(left + right) / 2];


while (i <= j) {

while (arr[i] < pivot)

i++;

while (arr[j] > pivot)

j--;

if (i <= j) {

tmp = arr[i];

arr[i] = arr[j];

arr[j] = tmp;

i++;

j--;

}

};


return i;

}

static void quickSort(int arr[], int left, int right) {

int index = partition(arr, left, right);

if (left < index - 1)

quickSort(arr, left, index - 1);

if (index < right)

quickSort(arr, index, right);

}


I can not see how to implement this algorithm in optimal way using java Data Structures, like java.util.Stack and
java.util.PriorityQueue.
Can you please give me an idea.

Thanks much in advance!!!!