Get index of element in set (STL C++) in asysmtotically less than O(n)

94 Views Asked by At

I have heard that we can use binary search along with Fenwick tree to do it in O(logn*logn) . We can also use PBDS to do it in O(logn) . Can some one explain in detain how to do them . If there is some other way please tell that also.

0

There are 0 best solutions below