Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What does Big O notation signify?
Think of it as the worst-case scenario for algorithm efficiency.
Define Theta notation.
It's about having matching upper and lower bounds.
What is Big O notation primarily used for?
Think of what Big O tells us about performance.
True or False: Theta notation can only define upper bounds.
Consider its definition and what it represents.
Provide a detailed proof to show that for the function 2n + 3, it is O(n).
Try substituting values of n to confirm the inequality.
Construct a function that is both θ(n log n) and demonstrate that it meets the requirements for both upper and lower bounds.
Consider how you might derive both bounds from mathematical expansions.
4 more questions in this section. Enroll free to practise them all.
Enroll free