bujsa kyoudai matching algorithm

Check fall-2023 branch for updated algorithm: big_little_matching.cpp, with matching being already compiled executable.

Usage:

1. Open /src/match.py
2. Edit .csv file path for bigs and littles, using formatting given by example files found in /misc
3. Run /src/match.py
4. Output should include the following:
   • Number of bigs and littles
   • Array format of bigs in littles (using curly brackets {})
   • Long list of big names, little names, and numbers next to them
   • Copy ONLY the long list of names
5. Edit big_little_matching.cpp littles variable and bigs variable with respective arrays, and edit num_big and num_little with big/littles amounts
6. Compile big_little_matching.cpp
7. Run the compiled file, i.e. ./matching
8. Paste output from python script
9. Matched list should output

Known issues:

• As of now, unmatched littles are automatically assigned to the first listed big, and vice versa, but this does not effect other results

Future plans:

• Checking for unmatched littles and sending a seperate list
• Automated pipeline from python script to C program
• Integration into web tool so no programming knowledge is necessary to use