What is the recursive quicksort MIPS version of the following C codes?

#include

void quicksort (int numbers[], int low, int high);

int main() { int size; int numbers[50];

scanf("%d", &size); for (int i = 0; i < size; i++) { scanf("%d", &numbers[i]); }

quicksort(numbers, 0, size - 1);

for (int i = 0; i < size; i++) { printf("%d ", numbers[i]); }

return 0; }

void quicksort(int numbers[], int low, int high) { int pivot, i, j, temp;

if (low < high) {

pivot = low; i = low; j = high;

while (i < j) { while (numbers[i] <= numbers[pivot] && i <= high) { i++; }

while (numbers[j] > numbers[pivot] && j >= low) { j--; }

if (i < j) { temp = numbers[i]; numbers[i] = numbers[j]; numbers[j] = temp; } }

temp = numbers[j]; numbers[j] = numbers[pivot]; numbers[pivot] = temp; quicksort(numbers, low, j - 1); quicksort(numbers, j + 1, high); } }