Question

How can I convert the following C code to MIPS Assembly?

+++++++++++++++++++++++++++++++++ MIPS main program ++++++++++++++++++++++++++++++++

.data # Defines variable section of an assembly routine.
array: .word x, x, x, x, x, x, x, x, x, x # Define a variable named array as a word (integer) array

# with 10 unsorted integer numbers of your own.

# After your program has run, the integers in this array # should be sorted.

.text # Defines the start of the code section for the program .

.globl main main:

la $a0, array # Moves the address of array into register $a0.

# Set argument 1 to the array.

addi $a1, $zero, 10   # Set argument 2 to (n = 10)

jal pancakeSort # Call pancakeSort
li $v0, 10 # Terminate program run
syscall

The C-code is

// Reverses arr[0..i]
void flip(int arr[], int k)  {

    int temp, start = 0;
    while (start < k) {

        temp = arr[start];
        arr[start] = arr[k];
        arr[k] = temp;
        start++;

k--; }

}

// Returns index of the maximum element in arr[0..n-1] int findMax(int arr[], int n) {

int max = arr[0];
intmi =0; for(inti=1;i<n;++i) {

if (arr[i] > arr[mi]) {
            mi = i;

} }

return mi; }

// The main function that sorts given array using flip operations. void pancakeSort(int *arr, int n) {

int size, i;

    printf(“\nThe original list is “);
    for(i = 0; i < n, i++)

        printf(“%d “, arr[i]);

    // Start from the complete  array and one by one
    // reduce current size   by one
    for (size = n; size > 1; size--) {

// Find index of the maximum element in arr[0..size-1] int mi = findMax(arr, size);

        // Move the maximum element to end of current array
        // if it's not already at the end.
        if (mi != size) {

// To move at the end, first move maximum number to beginning flip(arr, mi);

// Now move the maximum number to end by reversing current array

            flip(arr, size-1);
        }

}

    printf(“\nThe sorted list is “);
    for(i = 0; i < n, i++)

        printf(“%d “, arr[i]);
}

Answer 1