KwickClips Java · 41 sec · free
What is the Big O of 3n² + 5n + 9?
Short answer. O(n²).
Do you keep the constant 3 in 3n?
No. Constants are dropped, so it is O(n).
Keep the dominant term
| Steps | Big O |
|---|---|
| 3n + 5 | O(n) |
| 3n² + 5n + 9 | O(n²) |
| 50 | O(1) |
Remember
| Keep the fastest term |
| Drop constants |
Three n squared plus five n plus nine. What is its Big O? Keep the fastest growing term. Three n plus five is order n. With n squared, it is order n squared. A fixed fifty is order one. Keep the fastest term. Drop the constants.
This clip is from the full lesson: Algorithm Complexity and Big O Notation — 7 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868)
More KwickClips from this lesson
Why not just time the program with a stopwatch?40 sec
What is the Big O of two separate loops, one after the other?38 sec
Is linear search O(1) because it once found the item first?41 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy