在swap函数中，我传递了两个要交换的元素的地址。初始数组是5，1，4，2，8，代码应该执行冒泡排序

Implement Bubble sort in assembly. Follow the reference C code and translate it to assembly. The implementation requires you exact translation of the reference code, which means you need to implement using local variables, function calls, and parameter passing following the given c code. Submit the source code, screenshot of intermediate steps, and the sorted array in memory window.

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm Links to an external site. that repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping Links to an external site.their values if needed. These passes through the list are repeated until no swaps have to be performed during a pass, meaning that the list has become fully sorted. The algorithm, which is a comparison sort Links to an external site., is named for the way the larger elements "bubble" up to the top of the list.

 

// C program for implementation of Bubble sort
#include <stdio.h>

int arr[] = { 5, 1, 4, 2, 8 };

void swap(int* xp, int* yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
    int i, j;
    for (i = 0; i < n - 1; i++)

        // Last i elements are already in place
        for (j = 0; j < n - i - 1; j++)
            if (arr[j] > arr[j + 1])
                swap(&arr[j], &arr[j + 1]);
}

// Driver program to test above functions
int main()
{
    int n = sizeof(arr) / sizeof(arr[0]);
    bubbleSort(arr, n);
    return 0;
}

这是我目前的汇编代码：

elementswap proc
push ebp
mov ebp,esp

     push eax
     push ebx
        
        ;do swap
    mov eax,[EBP+8] 
    mov ebx,[EBP+12]
    mov [EBP+8],ebx
    mov [EBP+12],eax
    
    pop eax
    pop ebx
    mov esp,ebp
    pop ebp
    ret

elementswap endp

bubblesort proc
push ebp
mov ebp,esp
mov esi,0

    outerloop:
         mov edx,[EBP+12]
         mov ebx,[EBP+8]
         sub ebx,2
         mov ecx,ebx
         cmp esi,ebx; 0 1 2 3 4,4
         JE exit_loop
         sub ecx,esi
         mov edi,0
         JL innerloop
    
    innerloop:
         cmp edi,ecx ;0 1 2 3 4,4 ;0 1 2 3,3;0 1 2,2;0 1,1;0,0
         JE L3
         JL L1
    
    L1:
        mov eax,[edx]
        add edx,4
        cmp eax,[edx]; 5,1   5,4   5,2 ;  1 4 2 5 8; 1,4 4,2 4,5 8; 1 2 4 5 8
        JG eleswap ;if eax content is bigger than element of the address stored edx
        JLE L2 ;if eax is less or equal than element of the address stored edx
    
    eleswap:
         push eax
         mov eax,edx
         push eax
         call elementswap
         JMP L2
    
    L2:
        inc edi ;increment index innerloop
        JMP innerloop
     
    L3:
       inc esi
       JMP outerloop
       
    
    exit_loop:
    
    
    mov esp,ebp
    pop ebp
    ret

bubblesort endp

main proc
push ebp
mov ebp,esp

    mov eax,OFFSET myarr
    push eax
    
    mov eax,LENGTHOF myarr 
    push eax
    
    call bubblesort
    
    mov esp,ebp
    pop ebp
    ret
    
    invoke ExitProcess,0

main endp
end main

在呼叫bubblesort后，我期待1、2、4、5、8。