计算机科学与导论课后习题答案 第6章 程序设计与算法分析（Analysis of computer science and an introduction to the sixth chapter after-school exercise program design and algorithm）.doc

计算机科学与导论课后习题答案 第6章 程序设计与算法分析（Analysis of computer science and an introduction to the sixth chapter after-school exercise program design and algorithm） (3) index structure: each data structure indexing table, each data element occupying a table, each table usually contains the keyword and the address pointer. The key is to be able to sign only one data element data item. (4): the hash structure constructed by hash function, hash function to determine the value of the elements stored in the address. 7. what are the characteristics of algorithm algorithm, what? Answer: algorithm (Algorithm) is a set of clear and orderly, can be implemented step by step, it in the limited time to terminate and produce results. The characteristics of this algorithm are: (1) finiteness (termination): a complete algorithm must be implemented in a finite steps and reasonable finite time. (2): the uncertainty of each step in the algorithm must have a clear meaning, does not allow the existence of the ambiguity of the two. (3) the effectiveness (executable): the operation steps of the algorithm are described in the executable, and can finally get certain result. (4) input and output: an algorithm should have zero or more input data, there are 1 or more output data. 8. what is the algorithms time complexity and space complexity, how to say? Answer: the time complexity is related to the input function and the scale of solving the problem, the algorithm function takes the running time of algorithm. Note: T (n), wherein n represents the scale of the problem solving. The space complexity of algorithm (Space, complexity) space complexity measure algorithm that implements the algorithm program running on the computer in the occupied space size. Simply speaking, the space complexity and scale of solving the problem, algorithm of input correlation function. Note: S (n), wherein n represents the scale of the problem solving. Time and space complexity is also introduced, the symbol O to express T (n),