ordered map | The Supercomputing Blog (original) (raw)

There comes a time in most complex programs where you want to ask a simple question like, ‘have I already processed a string with this id’? Linear searches through an array are easy to write and work well enough for small array sizes. Plus, the memory overhead of linear searches is fantastic, since it basically has none. But when your arrays can contain many elements, it is time to ditch those linear searches and go with an ordered map or unordered map. Continue reading ‘Ordered map vs. Unordered map – A Performance Study’ »

Posted by admin on January 24, 2014 at 9:35 pm under C++, Optimization, Windows.
Tags: C++, Insertion, Lookup, map, Memory, ordered map, Performance, Speed, STL, unordered_map
Comment on this post.