lower_bound的时间复杂度是多少？

I have vector which is sorted in non-decreasing order. if i apply lower_bound(myvec.begin(),myvec.end(),val). What is the time complexity in this case?