Skip to content
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.

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

Page 574: The phrasing of the quadratic example makes it sound like all polynomial complexity is quadratic complexity, which is wrong and misleading. #123

WraithGlade opened this issue Jan 20, 2020 · 1 comment


Copy link

@WraithGlade WraithGlade commented Jan 20, 2020

From the following text:

Polynomial (or quadratic) time O(N^2) About 99,000,000 additional computations. An example is comparing all the elements in a collection with all the elements in another collection.

The way "Polynomial (or quadratic)" is phrased here is very likely to confuse or mislead readers that aren't already familiar with the subject matter. It makes it sound like all polynomial complexities are quadratic complexities. It makes it sound like "polynomial" and "quadratic" are 100% synonymous and equivalent in both directions. Only someone who already understands complexity theory will be able to understand what is actually intended here.

Copy link

@JLospinoso JLospinoso commented Jan 21, 2020

Thanks, @WraithGlade!

kruschk pushed a commit to kruschk/ccc that referenced this issue Apr 26, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
None yet
None yet

No branches or pull requests

2 participants