计算机科学导论原书第二版答案-Ch-08.pdf

CHAPTER 8 Algorithms (Solutions to Practice Set) Review Questions 1. An algorithm is an ordered set of unambiguous steps that produces a result and ter- minates in a finite time. 2. a. Sequence: An algorithm is a sequence of instructions, which can be a simple instruction or either of the other two constructs. b. Decision (selection): Tests a condition. If the result of testing is true, it follows a sequence of instructions; if it is false, it follows a different sequence of instructions. c. Repetition: This construct repeats a set of instructions. 3. Universal Modeling Language (UML) is a pictorial representation of an algorithm. It hides all of the details of an algorithm in an attempt to give the big picture; it shows how the algorithm flows from beginning to end. 4. Pseudocode is an English-like representation of an algorithm. 5. A sorting algorithm arranges data according to their values. 6. The three types of sorting algorithms discussed in this chapter are the selection sort, the bubble sort, and the insertion sort. 7. A searching algorithm finds a particular item (target) among a list of data. 8. The two major searching algorithms discussed in this chapter are the sequential search and the binary search. The sequential search is normally used for searching unsorted lists while the binary search is used for searching sorted lists. 9. An algorithm is iterative if it uses a loop construct to p