In the project, you are expected to implement a bubble sort algorithm in assembly language, evaluate its performance, and compare the performance with that of your C++ implementation.
Pseudo code for bubble sort is as follows:
procedure bubbleSort( A : list of sortable items )
n = length(A)
repeat
newn = 0
for i = 1 to n-1 inclusive do
if A[i-1] > A[i] then
swap(A[i-1], A[i])
newn = i
end if
end for
n = newn
until n = 0
end procedure
Requirements
1. You are required to use LOOP instruction to implement this nested loop.
2. You are required to use XCHGinstruction to swap elements.
3. To compare the performance, you need to write the main program to generate random numbers to populate a large integer array, and then call the subroutine to sort this array. Remember to get the time before and after the bubble sort to measure the performance.