Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
How efficient is the find() function on the std::map class? Does it iterate through all the elements looking for the key such that it’s O(n), or is it in a balanced tree, or does it use a hash function or what?
Log(n) It is based on a red black tree.
Edit: n is of course the number of members in the map.