Places
The time complexity class of T(n) = n + n log n.
What is ϴ(n log n)?
Class of functions that is both O(n) and Ω(n)?
What is ϴ(n)?
Closed form of the sum 1 + 2 + ... + n.
What is n(n+1)/2?
The time complexity of an T(n) = sqrt(n) + log n.
What is ϴ (sqrt(n))?
Class of functions that is less than or equal (i.e., think <= ) to log n when n gets large.
What is O(log n)?
Function that counts the number of basic operations for an algorithm with an input of size n.
What is T(n)?
The time complexity class of an in-order traversal of a binary tree.
What is ϴ(n)? (or What is linear time?)
Class of functions that is approximately equal (i.e., think "=") to 2^n when n is large.
What is ϴ(2^n)?
The function counts the number of basic operations in an all-vs-all comparison of the elements of an array of length n.
The best case time complexity class for a binary search.
What is ϴ(1)? (or What is constant time?).
The class of functions that grows as fast or faster as n.
What is Ω(n)?
The minimum number of basic operations for an algorithm that accesses each element of a matrix that is n by m.
What is n * m? (or What is T(n,m) = n * m?)
The time complexity of an algorithm with B(n)=n and W(n)=n^2.
What is O(n^2)?
A class of functions that grows much slower than ϴ(n^2) expressed with n^2.
What is o(n^2)?
The number of comparisons in binary search in the worse case.
What is W(n)=log(n)?