PSet1 FAQ
From 6.006 Wiki
Jump to:
navigation
,
search
Contents
1
Common Mistakes
1.1
Part A
1.2
Part B1
1.3
Part B2
1.3.1
(b)
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.
Views
Page
Discussion
View source
History
Personal tools
Log in
Navigation
Main Page
Lectures and Recitations
Problem Sets
Quizzes
Recent changes
Random page
Help
Search
Toolbox
What links here
Related changes
Special pages
Printable version
Permanent link