Domanda di colloquio di Barclays
Explain how a Map works
Risposta di colloquio
Anonimo
31 lug 2010
Although Map works much like a hashtable to its user, its actually implemented as a tree in the C++ Stl implementation. So lookup time is O(lg n)
Explain how a Map works
Anonimo
Although Map works much like a hashtable to its user, its actually implemented as a tree in the C++ Stl implementation. So lookup time is O(lg n)