can we say that the order_by_key() operation works as lower_bound?
Order_by_key related doubt
No,
For set lower_bound returns a pointer to the address of the element and we cannot find its position by subtracting set.begin() from it whereas, in ordered_set order_of_key returns the position of that element
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.