Well, if you search the vector from begin to end you'll have O(N) complexity.
But if you introduce an extra unordered_map you can get O(1) accesses into the vector.
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Search:Type: Posts; User: nuzzle Search: Search took 1.19 seconds.
Results 1 to 1 of 1
|
Click Here to Expand Forum to Full Width |