Inline Assembly, MASM

Program $3$: Inline Assembly

In this assignment we will be using high$-$level language, C$++,$ with inline assembly to complete specific tasks. One purpose of doing this is to help optimize code more efficiently, if possible. This also allows us to use high$-$level language for input, output, and more. Most of the time compilers can optimize your code efficiently, but there may be cases where it does not.

Requirements: $\backslash (\{\}^\{$i$\}\backslash )$

$-$ Create a constant variable for holding the size of the array using C$++$

$-$ Type: Integer

$-$ Name and Value: arrSize $=10$

$-$ Create the following pre$-$designed array using C$++$

$-$ Type: Integer

$-$ Name and Value: numArrA$[$arrSize$]\backslash (=\backslash \{9,3,4,6,1,7,2,8,5,0\backslash \}\backslash )$

$-$ Create a void function in C$++$ to sort the array using Bubble Sort algorithm

$-$ Function Name: bubbleSort

$-\backslash$# of Parameters: numArrA, arrSize $($constant$)$

$-$ Display the unsorted array using C$++$

$-$ Display the sorted array using C$++$

Problem:

Create a C$++$ program with inline assembly to do Bubble Sort on an unsorted pre$-$designed array with the values between $0$ and $9($unique$).$ Your program must use high$-$level language to do display and function calling. The Bubble Sort function must use assembly to sort the array. The algorithm in Pseudo$-$code for Bubble Sort is as follows: it

WHILE $($FLAG IS NOT EQUAL TO $0)$

SET INDEX TO $0$

SET FLAG TO $0$

WHILE $($INDEX IS LESS THEN ARRAY$\_$SIZE$)$

IF $($ARRAY$[$INDEX$]$ IS GREATER THEN ARRAY$[$INDEX $+1])$

SET TEMP TO ARRAY$[$INDEX$]$

SET ARRAY$[$INDEX$]$ TO ARRAY$[$INDEX $+1]$

SET ARRAY$[$INDEX $+1]$ TO TEMP

SET FLAG TO $1$

END$\_$IF

INCREMENT INDEX

END$\_$WHILE

END$\_$WHILE