We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent dba7712 commit 71aa718Copy full SHA for 71aa718
greedy_methods/gale_shapley_stable_matching.py
@@ -33,7 +33,7 @@
33
34
35
class GaleShapley:
36
- """Implementation of the Gale-Shapley algorithem
+ """Implementation of the Gale-Shapley algorithm
37
38
takes it 2 preference list as a 2D array of ints. First one is the
39
proposing side.
@@ -91,8 +91,7 @@ def find_matches(
91
cur_proposer = next(
92
prop for prop, rec in matches.items() if rec == receiver
93
)
94
-
95
- # give receiver new proposer match only if it preferes new over old
+ # give receiver new proposer match only if it prefers new over old
96
if receivers_preferences[receiver].index(proposer) < receivers_preferences[
97
receiver
98
].index(cur_proposer):
0 commit comments