j*****k
发帖数: 1198 | 1 There is one unknow integer in range (0, 10000).
Develop an algorithm to find it. The algorithm
should be faster than binary search. The faster,
the better. | d**e
发帖数: 6098 | 2 如果要快过binary search...这里要先sort再search，所以是O(n log n)吧
比它快，就要O(n)，用xor了……
【在 j*****k 的大作中提到】
: There is one unknow integer in range (0, 10000).
: Develop an algorithm to find it. The algorithm
: should be faster than binary search. The faster,
: the better.
| r*********s
发帖数: 2157 | 3 don't understand the question |
|
