1. Why dont we care about constants and lesser terms in a time complexity expression? Because we only care about ________________.
2. Prove that 3n^2 + 4n = O(n^2) as I did in the notes. (must give C and the starting point for n)
3. Binary search corresponds to the ______________binary search tree.

Sequential search corresponds to a / the ____________ tree.

Hint: think of the shape/height

4. Thus, the fastest ordered list search does W(n)=Theta(???) comparisons.
5. But, the fastest unordered list search does W(n)=Theta(???) comparisons.