Scribd Logo
Upload

Welcome to Scribd!

  • B23

    Uploaded by

    khoản 1 tài
    3 views1 page
    This document contains MIPS assembly code for a bubble sort algorithm. It loops through an array stored in memory, compares adjacent elements, and swaps them if out of order, continuing until the array is fully sorted. The code checks if the current index j is less than i, and if so continues the loop. It calculates memory addresses, stores the largest element in the correct index, decrements j, and repeats until the full array has been traversed and sorted.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains MIPS assembly code for a bubble sort algorithm. It loops through an array stored in memory, compares adjacent elements, and swaps them if out of order, continuing until the array is fully sorted. The code checks if the current index j is less than i, and if so continues the loop. It calculates memory addresses, stores the largest element in the correct index, decrements j, and repeats until the full array has been traversed and sorted.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    B23

    Uploaded by

    khoản 1 tài
    This document contains MIPS assembly code for a bubble sort algorithm. It loops through an array stored in memory, compares adjacent elements, and swaps them if out of order, continuing until the array is fully sorted. The code checks if the current index j is less than i, and if so continues the loop. It calculates memory addresses, stores the largest element in the correct index, decrements j, and repeats until the full array has been traversed and sorted.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    B3:

    loop 2: beq $t2, $t0, exit2 # Continue into the loop if j < i
    # else go to exit2

    exit 2:
    sll $t7, $t7, 2 # Set $t7 to maxindex*4
    add $t7, $t7, $t4 # Set $t7 to address of
    # A[maxindex]
    sw $t5, 0($t7) # Store A[j] in
    # A[maxindex]
    addi $t0, $t0, -1 # Decrement j
    sll $t5, $t0, 2 # Set $t5 to j*4
    add $t5, $t5, $t4 # Set $t5 to address of
    # A[j]
    sw $t6, 0($t5) # Store max in A[j]
    bne $t0, $t1, loop1 # Continue loop if j > 1

    You might also like