Multiple ChoiceIntermediate 30s
P vs NP asks whether
Choose the best answer for: P vs NP asks whether
Options
- 1Every algorithm eventually terminates on all inputs
- 2Comparison sorting is possible in linear time
- 3Problems verifiable in P-time are solvable in P-time
- 4Every graph can be made fully connected at low cost
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.