Hi guys, I have a simple question on STL's map<> container. My question is, how efficient is it to use the find algorithm with a map when the number of elements is very large? Particularly when the map is unordered? IS the algorithm faster if the map is ordered/sorted first?
Any fact based opinions will be greatly appreciated.