k****f
发帖数: 3794 | |
g*****g
发帖数: 34805 | 2 Depends on the implementation, many structures are implemented
by array and O(1) for access.
【在 k****f 的大作中提到】
: 怎么证明的？
|
P*****f
发帖数: 2272 | 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.
|
t****t
发帖数: 6806 | |
k**f
发帖数: 92 | 5 看了那本经典的书，果然是O(N)算法，和qsort长得太象了
【在 t****t 的大作中提到】
: http://en.wikipedia.org/wiki/Selection_algorithm
|
