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?
评论
请
登录后发表观点
- 积分
0 - 话题
0 - 评论
3228 - 注册排名
1413
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?