问题的复杂度（complexity）.docVIP

問題的複雜度（complexity） 問題的複雜度中之「問題」（problem）所指的並非「單一問題」，而是「某類問題」，例如：加法「問題」、乘法「問題」、排序「問題」…等。 In theory of computational complexity, “problem” means a kind of problem, instead of an instance of problem. For example, “1 + 1” is an instance of addition problem. 問題的「複雜度」，係指要解決該類問題，需要花多少演算時間(步驟)。 Problem complexity is a measurement of time (steps) to solve a kind of problem. There are two assumptions: 假設有充足的記憶體空間。 There is sufficient (unlimited) memory space. 假設演算法採用順序性處理(sequential processing)，而非平行處理(parallel processing)。 Algorithm uses sequential processing, instead of parallel processing. 問題的類型 (type