thatguy2048 / GaleShapley / 0.1.5
This is an implementation of the Gale-Shapley stable marriage algorithm. This does not check for that all of the input names are valid, it only checks that the number of rows are divisible by 2, and that each row contains 'n' names, where 'n' is the number of rows divided by 2.