Redian新闻
>
stl的nth_element的复杂度是不是O(N)?
avatar
g*g
2
Depends on the implementation, many structures are implemented
by array and O(1) for access.

【在 k****f 的大作中提到】
: 怎么证明的?
avatar
P*f
3
I remember the semantics is to return the nth smallest element

Depends on the implementation, many structures are implemented
by array and O(1) for access.

【在 g*****g 的大作中提到】
: Depends on the implementation, many structures are implemented
: by array and O(1) for access.

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。