3 ms·
is it O(n) for those lists/posters or O(log n)? they're usually sorted, aren't they?
by a-dub 4y ago
is it O(n) for those lists/posters or O(log n)? they're usually sorted, aren't they?
- defanor 4y agoI don't know about Germany, but sometimes they are sorted in the order they are visited by a bus (describing the route), not alphabetically. Which makes it harder (O(n)) if you know the name, but don't know where it is located on the route. Listing them alphabetically would be closer to this approach though, and likely more accessible.