algorithmic complexity requirement?
來源:
haha2000
於
2009-05-18 19:19:21
[
舊帖
] [
給我悄悄話
] 本文已被閱讀:次
no requirement, then pair-wise search the first n+1 numbers
constant memory, O(n^2) complexity..