Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| courses:cs211:winter2018:journals:martinj:chapter2 [2018/01/19 22:43] – created admin | courses:cs211:winter2018:journals:martinj:chapter2 [2018/01/21 16:14] (current) – admin | ||
|---|---|---|---|
| Line 28: | Line 28: | ||
| __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)) | ||
| + | |||
| + | ===== 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) | ||
| + | |||
| + | |||
| + | |||
