Quote Originally Posted by aseminov
I realize the Insert(AddElement) for vector is O(n) and could be faster if I use a map which would be O(logn). I would say my data set will be only a few hundred members at most. Should I consider using a map?
Well, if you #include <unordered_map> and use a std::unordered_map, insertion will be O(1) in the average case.