Part II Further, examine the design by developing an assembly language program that sorts a list of 32-bit numbers into descending order. The first entry in the list gives the number of data elements to be sorted, and the rest of the list provides the data. The list of data must be sorted “in place,” meaning that you are not allowed to create a copy in memory of the list to do the sorting.
The list can be defined as part of the data for your assembly language program as follows:
List: .word 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Test your algorithm with various data sets and ensure that the list of data is sorted correctly in-place in the memory. A good debugging technique for this code is to use the Memory tab in the Monitor Program to view the contents of the list as the sorting algorithm progresses Each time a breakpoint is reached by the processor (or instruction is single-stepped), the list can be examined to see how the items are being swapped.