Written by Adam Claxton, Connor Jackson, John Costa, Maegan Dyakiw.
Implementation of Merge Sort using MIPS Assembly language. Test suite provided by our professor, Padraic Edgington.
Base Case & Error Handling - Maegan
Divison of array - John & Adam
Merging of subarrays - Connor
The arrays are data structures that can be visualized as follows: The 1st element is the number of values in the array. The subsequent values are the values inside the array.
EXAMPLE: [5 2 6 5 2 8] The first number is 5, because there are 5 values. The 5 values are: 2 6 5 2 8
Then the program properly sorts them, despite size.