Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:martinj:chapter2 [2018/01/21 16:13] – admin | courses:cs211:winter2018:journals:martinj:chapter2 [2018/01/21 16:14] (current) – admin | ||
|---|---|---|---|
| Line 29: | Line 29: | ||
| __Asymptotically Tight Bounds__: if T(n) is both O(f(n)) and Ω(f(n)), we say that T(n) is Θ(f(n)) | __Asymptotically Tight Bounds__: if T(n) is both O(f(n)) and Ω(f(n)), we say that T(n) is Θ(f(n)) | ||
| - | ===== Headline | + | ===== 2.3: Using Lists and Arrays for Stable Matching |
| Review: Gale-Shapley Stable matching algorithm has at most n^2 iterations --> worst-case runtime = O(n^2) | Review: Gale-Shapley Stable matching algorithm has at most n^2 iterations --> worst-case runtime = O(n^2) | ||
