Blog

____________ Search repeatedly divides the search space in half.

Which notation describes the upper bound of an algorithm’s growth rate?

The runtime notation that describes the lower bound of an algorithm is ____________.

The process of converting a key into an index location is called ____________.

Which data structure is best suited for implementing an Undo feature in a text editor?

Explain the differences between Big O, Big Ω, and Big Θ. Why are all three useful?

A collision in a hash table occurs when:

A graph consists of vertices and ____________.

What is the average-case runtime of Binary Search?

Describe recursion. What is it? When should you use it? Why should you use it?  Give a scenario.