The project is made up of two lists of numbers named l_a and l_b.
In the beginning, l_b will be empty and l_a will contain a certain amount of positive or negative numbers.
The objective of the project is to sort l_a.
The project only use the pb, rb and ra instructions, the optimization is not one of the advantages therefore.
The lack of optimization is due to the algorithm used: the Radix Sort.
You might find all the informations you need on the Radix Sort on this Wikipedia post: https://en.wikipedia.org/wiki/Radix_sort
Test Name | Test Result |
---|---|
01 - One Number | 100% |
01.5 - One Number | 100% |
02 - Sorted List | 100% |
02.5 - Sorted List | 100% |
03 - Small Unsorted List | 100% |
03.5 - Small Unsorted List | 100% |
04 - Medium Unsorted List | 100% |
04.5 - Medium Unsorted List | 100% |
05 - Big Unsorted List | 100% |
05.5 - Big Unsorted List | 100% |
Final Result | 100% |