legv8 assembly Code

Due on 10/7

Problems (to be solved on LEGv8 assembly):

* Implement a swap procedure that swaps the values in two different 8-byte

integers in memory.

* Implement a find smallest procedure that finds the smallest 8-byte integer

in an array and returns its index.

* Implement selection sort using your find smallest and swap procedures. To

be clear, selection sort can be more efficiently implemented without any

helper procedures, but implementing it in assembly is easier with the

helpers--and it gives you experience with procedure calls and stack

manipulation--so we are requiring that you do it this way.

Pseudocode for the selection sort:

SelectionSort(array)

for each element in array in order from first to last:

swap element with smallest element in the subarray that it begins

* Implement an iterative binary search on an array of 8-byte integers

* Implement a recursive binary search on an array of 8-byte integers

* Implement a procedure to fill an array with consecutive 8-byte integers in

reverse-sorted (high to low) order

* Implement a "main" procedure that ties all of this together by:

** Calling your fill procedure to create a reverse sorted array in main

memory.

** Sorting that array using your selection sort implementation

** Searching for a number using your iterative binary search

** Searching for the same number using your recursive binary search

** Store the difference of your two binary search return values (should be

zero) in main memory at offset 0.

** Program ends with a DUMP

Assembly C Programmierung Softwarearchitektur

Projekt-ID: #21378336

Über das Projekt