New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Page 21 #9

Closed

Laakeri opened this issue Feb 25, 2017 · 0 comments

Laakeri commented Feb 25, 2017

The time complexity table is misleading. O(n log n) is always ok when n = 10^6. Also O(n^2) is ok for n=5000, O(n^3) is ok for n=500.

pllk closed this as completed in

af4499e

frarteaga pushed a commit to frarteaga/cphb-es that referenced this issue


          Fix time complexity table [closes pllk#9]

2705ac7

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