贝叶斯的吟唱
关于数据和逻辑的世界
Sunday, August 22, 2010
基于比较的顺序统计(中值）最坏的情况计算复杂度
最坏的情况下，计算顺序统计值的时间复杂度2n <= T <= 3n
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment