mirror of
https://github.com/Brandon-Rozek/website.git
synced 2025-10-10 06:51:13 +00:00
Fixed titles, math rendering, and links on some pages
This commit is contained in:
parent
9f096a8720
commit
330ace0de9
61 changed files with 303 additions and 115 deletions
|
@ -1,4 +1,7 @@
|
|||
# Greedy Algorithms
|
||||
---
|
||||
title: Greedy Algorithms
|
||||
showthedate: false
|
||||
---
|
||||
|
||||
Greedy Algorithms are about making the best local choice and then blindly plowing ahead.
|
||||
|
||||
|
@ -33,4 +36,4 @@ An unstable match is when
|
|||
The Gale-Shapley algorithm is a great greedy fit. It goes like this
|
||||
|
||||
1. An arbitrary unmatched hospital A offers its position to the best doctor a who has not already rejected it.
|
||||
2. If a is unmatched, she tentatively accepts A's offer. If a already had a match but prefers A, she rejects her current match and tentatively accepts the new offer from A. Otherwise a rejects the new offer.
|
||||
2. If a is unmatched, she tentatively accepts A's offer. If a already had a match but prefers A, she rejects her current match and tentatively accepts the new offer from A. Otherwise a rejects the new offer.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue