This project provides a solution to the problem of generating random lab partner assignments that are different for each iteration. Instead of randomly generating an assignment for each day (which would inevitably cause repeated partnerships), we implement an algorithm that creates the maximum possible number of partnerships without repeats.
Simply type (or paste) all students' full names into the left box, one name per line. After clicking the "Generate" button, an output is generated in the middle box, showing each student and who their partner is. You can also switch between lab days, where the algorithm guarantees that each student will have a different partner on every lab day. Necessarily, for n students, Random Partners generates n-1 days of partnerships. To export output, simply click the buttons to copy an individual day, or copy output for all days, or download output for all days to a .txt file.
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Distributed under the GPL-3.0 License. See LICENSE for more information.
Blaine Traudt - blaine-t - blaine-t@bathost.net
Anton Angeletti - anton-3 - angelettianton@gmail.com
Project Link: https://github.com/blaine-t/randomPartners