For sorting brownies into tent groups
Project description
#brownieSort A programme for sorting brownies into groups (tents) of equal size according to friendships. Brownies and friendship choices are imported from a text file. An algorithm is run to find the optimal (or near best) groupings of brownies. The best camp can be printed to the screen as a list of tents, their occupants, and the associated happiness scores.
in the UK, a brownie is a junior girl-guide (or junior girl-scout)
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
brownieSort-0.0.1.tar.gz
(5.3 kB
view hashes)
Built Distribution
Close
Hashes for brownieSort-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | e91b3fac710981dfecba56e7a8ffd433692fdedbb5972b00754620fcb94ffc97 |
|
MD5 | d2481d3c58037d321bde31b1fe72ba41 |
|
BLAKE2b-256 | a8480135504d94f8ab9d498baac62a37af5ee71bd2f3d5b7778da1c4745ed5f1 |