Skip to content

Conversation

@ryoung18
Copy link

@ryoung18 ryoung18 commented Aug 1, 2017

Completed. Please review

Copy link
Contributor

@mmmaaatttttt mmmaaatttttt left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

just one quick fix to part 1 and you should be good.

5. `O(n + n + n + n)`
// O(n)
6. `O(1000 * log(n) + n)`
// log(n)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

double check this one - what grows faster, log(n) or n?

// log(n)
7. `O(1000 * n * log(n) + n)`
// nlog(n)
8. `O(2^n + n^2)`
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

2^n grows faster than n^2, but we didn't talk about this in class so I wouldn't sweat it.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants