21
If an O(n²) algorithm takes 1 second for n = 1000, about how long for n = 3000?
Medium
Back to Complexity Analysis
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.