I have implemented the Lower Bound algorithm without using STLthe standard library. But Why I am getting TLEtime limit exceeded for the above code?
Is STL faster than the above code? Is the STL's std::lower_bound()
faster than the above code?
The above code is giving O(nlogn)\$O(n \log n)\$.