Greedy Algorithms8 sections · 316 units
Open in Course

Quiz: Counterexample Thinking

Finding failures

Check Your Understanding

You are testing if greedy works. What size input should you try first?

  1. A.n = 100 to stress test
  2. B.n = 1 as base case
  3. C.n = 2 or 3 to check by hand
  4. D.Random large inputs
Start the roadmap to answer the quizzes and solve the challenges