4 ms·
To be O(N), the time required for the lookup would have to continue to grow indefinitely. This has an upper bound.
by slavik81 7y ago
To be O(N), the time required for the lookup would have to continue to grow indefinitely. This has an upper bound.
- deleted 7y ago[deleted]