algorithm - C++ STL set implementation -
why c++ set implemented binary tree instead of hashset, can provide average case complexity of o(1) compared o(log n) provided binary tree?
because c++ sets ordered t's comparison operator, makes possible iterate on members in predictable way. if know set insert, test membership, and/or remove elements, std::unordered_set, implements hashset, exists since c++11.
Comments
Post a Comment