Performance of various VC++ data structures

[Kelvin]

to All,

I'm a newbie in VC++, can anyone tell me about the
performance in various Data Structures (eg. Enum, map,
list, vector, hash, arrayList)?

I would like to know performance on CPU and Memory Usage.

eg. Mem usage may involve the mem usage on
creating/deleting an element in the structure.

eg. CPU performance may involve the overhead in iterating
the structure (just estimation will do)

By the way, I'm not very familiar to their
advantages/disadvatntages too, so can anyone also tell me
about it?

Thanks!

from kusanagihk

 

[Ronald Laeremans [MSFT]]

Hi Kevin,

The easiest way to gain this information is to tread a decent book on
algorithms and data structures. There is nothing VC specific in here and if
you don't have the base level understanding, you won't be able to do much
with any answers you would get anyway.

Something like the following book would be a reasonable start:
Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting,
Searching (3rd Edition)
by Robert Sedgewick

Ronald Laeremans
Visual C++ team