Skip to content

Conversation

@cyberlytics
Copy link

Changed "Complexity" to "Efficiency", because Big O Notation is a way to measure an algorithm's efficiency.

Big-O classes should not be confused with the actual complexity classes (= P, QP, DLOGTIME, NP, PSPACE,...). Both Big-O and complexity classes are part of Computational Complexity Theory in computer science, thus, "complexity" is half right (but still wrong to some degree). This might seem minor and philosophical, but the terminology can be very confusing for beginners. Please accept this rephrasing in the table headings, it is important to university teaching.

… to measure an algorithm's efficiency.

Big-O classes should not be confused with the actual complexity classes (= P, QP, DLOGTIME, NP, PSPACE,...). Both Big-O and complexity classes are part of Computational Complexity Theory in computer science, thus, "complexity" is half right (but still wrong to some degree). This might seem minor and philosophical, but the terminology can be very confusing for beginners. Please accept this rephrasing in the table headings, it is important to university teaching.
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