This video is a goldmine, thanks for taking the time to make it. But it would be nice if you added timestamps for each content for easy access in the description!
how the bool operator < function works , as we are just passing the object for which the this pointer works , what is the argument object for this function to whom this->priority gets compared to ??
This video is a goldmine, thanks for taking the time to make it. But it would be nice if you added timestamps for each content for easy access in the description!
You can check out the new Abax C++ container library, which makes elements sorted and hashed. Insert is O(logn) and everything else is O(1).
Very nicely told...
This was helpful. Thank you!
how the bool operator < function works , as we are just passing the object for which the this pointer works , what is the argument object for this function to whom this->priority gets compared to ??
it takes the argument from the next inserted element whether it is priority queue or set or map(binary tree)...
please speak clearly itteeerrratoraaaaaaaaaa I cant understand clearly .