--description--

In this video, you will review the key concepts taught so far including algorithmic thinking, and Big O notation.

--questions--

--text--

Which of the following should be true when it comes to algorithms?

--answers--

It should always use the maximum amount of memory available.

---

It should never repeat any steps, even if needed.

---

It should finish in a finite amount of time.

---

It should produce random results each time it runs.

--video-solution--

3