algorithmic complexity requirement?

来源: 于 2009-05-18 19:19:21 [旧帖] [给我悄悄话] 本文已被阅读：次

no requirement, then pair-wise search the first n+1 numbers

constant memory, O(n^2) complexity..