PSet1 FAQ

From 6.006 Wiki

Revision as of 20:44, 4 October 2008 by Wrightc (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Contents

Common Mistakes

Part A

Part B1

Part B2

(b)

While nlg(n) is an upper bound on the recurrence, it is not a tight (theta) bound.

Retrieved from "http://6.006.scripts.mit.edu/~6.006/fall08/wiki/index.php?title=PSet1_FAQ"
Personal tools