I want a map in which keys are string and and values are integer, What is the complexity of updating the values of a key at any point of time in java (Hashmap, linkedHashMap, TreeMap, Hashtable ) or using map in c++.
hello arpit , you can use unordered_maps . declare it as unordered__map < string,int > mymap; here strings is an inbuilt class available in header file that can be included using #include . for the complexities you can look into this http://stackoverflow.com/questions/222658/multiset-map-and-hash-map-complexity
it depends upon the type of map you are using , datatype too.
Being bounded by my knowledge , i think the complexity for using unordered_map is O(L+k) where O(k) is the unordered__map factor and O(L) for creating a hash corresponding to your string .