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 secVoice-over is AI-generated; the script is written and checked by Kajal Ma'am. Confirm anything you plan around against your official board document. We never ask for a password or an OTP.