Skip to page content
Computational Complexity and Big O Notation
Computer Science · Chapter 13 · Section C: Inheritance, Interfaces, Polymorphism, Data Structures and Complexity
Not started Not started
Your path through this chapter
Visual lesson Coming soon
Short slides, one idea at a time. We are preparing this chapter's lesson.
Notes Coming soon
Clear chapter notes for quick revision.
Flashcards Coming soon
Quick recall of key terms and facts.
Practice Coming soon
Board-style questions with instant checks.
Chapter test Free
Short and long chapter tests in board pattern, with results and analysis.
Step 5: Not started
Topics 4
- Concrete computational complexity; input size; estimating complexity in terms of methods
- Dominant term and constants; best, average and worst case
- Big O notation and common complexity classes
- Complexity of searching, sorting and solving linear equations