Bubble Sort.

Write a program that sorts an array using bubble sort algorithm.

The size of the array will be located at the address array_size, the integer array (32-bit integer words) will start at the address array_start.

The program should sort the array in ascending order. Your program will be tested with different array sizes and different values in the array.

The complete task description can also be found here, Makefile and template files for your own testing can be found on GitLab.

In: Size of the array located at address array_size, the array start is located at the address array_start.

Out: Sorted array of length array_size

Your program will be run with the following arguments:


				--dump-cycles --cycle-limit 100000 --asm submission.S

Your program will be scored by this following metric:


				Runtime of the program in cycles.

For interactive solution, you can use QtRvSim. The web version of the simulator is located here.

Top Scores (cycles)

ComputerArchitectures Education