KwickClips Cyber Safety and Ethics · 46 sec · free
What does Big O count?
Short answer. Steps as n grows.
Which is faster for big data, lower or higher?
Lower.
Big O
| Big O | Name | Example |
|---|---|---|
| O(1) | constant | stack push |
| O(log n) | logarithmic | binary search |
| O(n) | linear | linear search |
| O(n²) | quadratic | bubble sort |
Remember
| Big O counts steps as n grows |
| Lower is faster for big data |
Two programs work. Which is faster for big data? Big O shows growth. O of one is constant. O of log n is logarithmic. O of n is linear. O of n squared is quadratic. Remember two things. It counts steps as n grows. Lower is faster.
This clip is from the full lesson: Data Structures in C++: Linked Lists, Stacks and Queues — 9 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: Programming All levels C++, Programming All levels C++, Programming All levels C++
More KwickClips from this lesson
What does the last node point to?41 sec
Which one is a pile of plates?42 sec
Which search needs sorted data?43 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