Multiple ChoiceIntermediate 30s
Greedy: Limitation
A greedy algorithm may fail when:
Options
- 1The input data set is simply too large to process quickly
- 2A locally optimal choice does not lead to a globally optimal solution
- 3The input contains numbers that have already been sorted
- 4The problem happens to involve only array data structures
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.