Greedy Algorithms8 sections · 316 units
Open in CourseQuiz: Counterexample Thinking
Finding failures
Check Your Understanding
You are testing if greedy works. What size input should you try first?
- A.n = 100 to stress test
- B.n = 1 as base case
- C.n = 2 or 3 to check by hand
- D.Random large inputs