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.
[ad_1]
I write an algoritm in C++ that uses std::unrodered_map.
I have std::unrodered_map<char, int> data structure. There are only 30 types of characters that can be inserted and deleted from the map. But, those characters can be inserted and deleted many times (e.g. million times). Can I say that the space complexity is O(1) since only up to 30 types of characters can be inside the map?
[ad_2]
