one algorithsm question# CS - 计算机科学
p*o
1 楼
【 以下文字转载自 JobHunting 讨论区 】
发信人: plvto (東東), 信区: JobHunting
标 题: one algorithsm question
发信站: BBS 未名空间站 (Fri May 18 17:18:23 2007), 转信
how to do this search in A[N]?
1. {A[0]}, {A[1]}, ..., {A[N-1]}
2. {A[0], A[1]}, {A[0], A[2]}, ... {A[N-2], A[N-1]}
... ...
N. {A[0], A[1], ..., A[N-1]}
use for loop from 00...0 to 11...1 (a N digits binary number) ?
any better algorithsm?
发信人: plvto (東東), 信区: JobHunting
标 题: one algorithsm question
发信站: BBS 未名空间站 (Fri May 18 17:18:23 2007), 转信
how to do this search in A[N]?
1. {A[0]}, {A[1]}, ..., {A[N-1]}
2. {A[0], A[1]}, {A[0], A[2]}, ... {A[N-2], A[N-1]}
... ...
N. {A[0], A[1], ..., A[N-1]}
use for loop from 00...0 to 11...1 (a N digits binary number) ?
any better algorithsm?
