Question

Task is to implement the following algorithms in Assembly language for x86 processor

1) Insertion sort 

Demonstrate 

• 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

Answer 2

[su_box title=”Bubble Sort” style=”bubbles” box_color=”#1d318d”]

org 100h

.data

str db 10,13,”Enter Values: $”
str1 db 0dh,0ah,”Bubble Sorted: $”
array db 10dup(0)

.code

mov ah,9
lea dx,str
int 21h

mov cx,10
mov bx,offset array
mov ah,1

inputs:
int 21h
mov [bx],al
inc bx
Loop inputs

mov cx,10
dec cx

nextscan:
mov bx,cx
mov si,0

nextcomp:
mov al,array[si]
mov dl,array[si+1]
cmp al,dl

jc noswap

mov array[si],dl
mov array[si+1],al

noswap:
inc si
dec bx
jnz nextcomp

loop nextscan

mov ah,9
lea dx,str1
int 21h

mov cx,10
mov bx,offset array

; this loop to display elements on the screen
print:
mov ah,2
mov dl,[bx]
int 21h
inc bx
loop print

ret

[/su_box]