单项选择题
A.动态规划法(Dynamic Programming) B.分治法(Divideand Conquer) C.回溯法(Backtracking) D.分枝定界法(Branch and Bound)
A.n B.[n/2] C.[log2n] D.[log2(n+1)]
A.确定性 B.近似 C.概率 D.加密