Student(s):
Leo Graham, UFID: 7279-6525
N/A, UFID: N/A
Run Instructions:
- Matcher:
- In the command line, navigate to the /src/ directory from the repository. Once in the /src/ directory, run:
-- python matchingengine.py
- Verifier:
- In the command line, navigate to the /src/ directory from the repository. Once in the /src/ directory, run:
-- python verifier.py
- Example Generator:
The purpose of this program, examplegenerator.py, was to assist in Task C, but can also be a general solution for creating example files. Upon execution, it will create several example files, following the naming convention example_n.in, with n = 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048. If you wish to use any of these files as the input for either the generator or verifier, you will need to drag the file into /data/ and manually name it to example.in
- In the command line, navigate to the /src/ directory from the repository. Once in the /src/ directory, run:
-- python examplegenerator.py
Assumptions:
- The input file must be located in the /data/ directory, and must be named example.in
- The output file, used for verification in verifier.py, must be located in /data/, and must be named example.out
- It will automatically populate in /data/ upon running matchingengine.py
Task C:
Matching Generator Graph:
This graph is consistent with the Big-Oh time complexity of the gale-shapley algorithm, O(n^2).
Verifier Graph:
This graph is consistent with the Big-Oh time complexity derived from the verification program, O(n^3).