Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What does Big O notation primarily measure?
Think about algorithm performance.
Is O(n) an upper bound for the function t(n) = 5n + 3?
Consider how functions increase.
What is Big O notation used for?
Remember its purpose relates to performance.
True or False: Omega notation represents an upper bound.
Think about which direction it expresses bounds.
Demonstrate that the function t(n) = n^3 + 4n + 7 is O(n^3) and provide constants to support your argument.
Identify how the terms contribute to the dominant growth.
Given two functions f(n) = n^2 and g(n) = 2^n, determine if either can bound the other as n approaches infinity.
Assess their growth rates at large n values.
4 more questions in this section. Enroll free to practise them all.
Enroll free