从C++到MIPS汇编语言的排序数组代码转换

#include <iostream>

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pivot = arr[high];
        int i = low - 1;

        for (int j = low; j <= high - 1; j++) {
            if (arr[j] < pivot) {
                i++;
                std::swap(arr[i], arr[j]);
            }
        }

        std::swap(arr[i + 1], arr[high]);

        int pivotIndex = i + 1;

        quickSort(arr, low, pivotIndex - 1);
        quickSort(arr, pivotIndex + 1, high);
    }
}

int main() {
    int arr[] = {5, 2, 8, 12, 3};
    int n = sizeof(arr) / sizeof(arr[0]);

    quickSort(arr, 0, n - 1);

    std::cout << "Sorted array: ";
    for (int i = 0; i < n; i++) {
        std::cout << arr[i] << " ";
    }

    return 0;
}

.data
arr: .word 5, 2, 8, 12, 3
n: .word 5

.text
.globl main

main:
    la $t0, arr
    lw $t1, n
    sub $t2, $t1, 1

    jal quickSort

    la $a0, arr
    li $v0, 4
    syscall

    li $v0, 10
    syscall

quickSort:
    addi $sp, $sp, -12
    sw $ra, 0($sp)
    sw $s0, 4($sp)
    sw $s1, 8($sp)

    move $s0, $a0
    move $s1, $a1

    blt $s0, $s1, partition

    lw $ra, 0($sp)
    lw $s0, 4($sp)
    lw $s1, 8($sp)
    addi $sp, $sp, 12
    jr $ra

partition:
    lw $t3, ($s1)
    move $t4, $s0
    addi $t5, $s0, -4

loop:
    addi $t5, $t5, 4
    lw $t6, ($t5)
    ble $t6, $t3, swap

    addi $t4, $t4, 4
    lw $t7, ($t4)
    bne $t4, $t5, loop

    j swap

swap:
    sw $t6, ($t4)
    sw $t7, ($t5)
    j loop