how unordered set is implemented using hashing?
Unoredered set implementation
hello @aman17nov1999
All operations on the unordered_set takes constant time O(1) on an average which can go up to linear time O(n) in worst case which depends on the internally used hash function
here is the code for the implementation of the unordered set :
there are comments as well in the code hope this clears your doubt .
if you have any doubt in any line or concept you can ask here .
Happy Learning !!
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.