Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2011:journals:camille:chapter2 [2011/01/25 15:37] – [Section 5: Priority Queues] cobbc | courses:cs211:winter2011:journals:camille:chapter2 [2011/01/31 02:47] (current) – [Section 1: Computational Tractability] cobbc | ||
|---|---|---|---|
| Line 12: | Line 12: | ||
| Again, this section was very readable. I thought that they did a great job of explaining why we need the mathematical definition of efficiency and how we get to it. And I read this after our classes on t, and I think that was good for me, because I already knew what to expect. | Again, this section was very readable. I thought that they did a great job of explaining why we need the mathematical definition of efficiency and how we get to it. And I read this after our classes on t, and I think that was good for me, because I already knew what to expect. | ||
| + | * **Sara Says:** | ||
| + | "Wait I thought our algorithm for the stable matching problem took O(N^2) time?" --> Yes, | ||
| + | that's correct. | ||
| + | pairings (N!), find one that is stable and that's the solution." | ||
| + | Gale-Shapley is a more efficient algorithm. | ||
| ===== Section 2: Asymptotic Order of Growth ===== | ===== Section 2: Asymptotic Order of Growth ===== | ||
