Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Merge-Sort-Assembly/README.md
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
22 lines (15 sloc)
639 Bytes
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Merge-Sort-Assembly | |
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. |