Question

Task is to implement the following algorith ms in Assembly language for x86 processor. Sort 1. Bubble Demonstrat Sorted Array of 10 elements in Watch Window for each one Running time of each algorithm

sample bubble sort code:
;----------------------------------------------------------
BubbleSort PROC USES eax ecx esi,
pArray:PTR DWORD, ; pointer to array
Count:DWORD ; array size
;
; Sort an array of 32-bit signed integers in ascending
; order, using the bubble sort algorithm.
; Receives: pointer to array, array size
; Returns: nothing
;-----------------------------------------------------------
mov ecx,Count
dec ecx ; decrement count by 1
L1: push ecx ; save outer loop count
mov esi,pArray ; point to first value
L2: mov eax,[esi] ; get array value
cmp [esi+4],eax ; compare a pair of values
jg L3 ; if [ESI] <= [ESI+4], no exchange
xchg eax,[esi+4] ; exchange the pair
mov [esi],eax
L3: add esi,4 ; move both pointers forward
loop L2 ; inner loop
pop ecx ; retrieve outer loop count
loop L1 ; else repeat outer loop
L4: ret
BubbleSort ENDP

Answer 1

;Bubble sort 10 numbers in place .model tiny .data db 3,7,9,1,8,2,4,5,3,6,10 nums count equ 9 One less than count of the array. .code .startup dx, count mov oloop: mov cx, count lea si, nums iloop: mov al, [si] ;Because compare can't have both memory cmp al, [si+1] ; if al is less than [si+1] Skip the below two lines for swapping. jl xchg al, [si+1] ; Coz we si], al can't use two memory locations in xchg directly. mov common: INC si loop iloop dec dx jnz oloop .exit end