chapter 5: 演算法 algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586...
TRANSCRIPT
![Page 2: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/2.jpg)
5-2
學習目標
• 5.1 The Concept of an Algorithm• 5.2 Algorithm Representation• 5.3 Algorithm Discovery• 5.4 Iterative Structures• 5.5 Recursive Structures• 5.6 Efficiency and Correctness
![Page 3: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/3.jpg)
5-3
Definition of Algorithm
An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process.
![Page 4: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/4.jpg)
5-4
Algorithm Representation
• Requires well-defined primitives• A collection of primitives constitutes a
programming language.
![Page 5: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/5.jpg)
5-5
Figure 5.2 Folding a bird from a square piece of paper
![Page 6: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/6.jpg)
5-6
Figure 5.3 Origami primitives
![Page 7: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/7.jpg)
5-7
Pseudocode Primitives
• Assignment
name expression
• Conditional selection
if condition then action
![Page 8: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/8.jpg)
5-8
Pseudocode Primitives (continued)
• Repeated executionwhile condition do activity
• Procedureprocedure name (generic names)
![Page 9: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/9.jpg)
5-9
Figure 5.4 The procedure Greetings in pseudocode
![Page 10: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/10.jpg)
5-10
Polya’s Problem Solving Steps
• 1. Understand the problem.• 2. Devise a plan for solving the problem.• 3. Carry out the plan.• 4. Evaluate the solution for accuracy and
its potential as a tool for solving other problems.
![Page 11: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/11.jpg)
5-11
Getting a Foot in the Door
• Try working the problem backwards• Solve an easier related problem
– Relax some of the problem constraints– Solve pieces of the problem first (bottom up
methodology)• Stepwise refinement: Divide the problem into
smaller problems (top-down methodology)
![Page 12: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/12.jpg)
5-12
Ages of Children Problem
• Person A is charged with the task of determining the ages of B’s three children.– B tells A that the product of the children’s ages is 36.– A replies that another clue is required.– B tells A the sum of the children’s ages.– A replies that another clue is needed.– B tells A that the oldest child plays the piano.– A tells B the ages of the three children.
• How old are the three children?
![Page 13: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/13.jpg)
5-13
Figure 5.5
![Page 14: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/14.jpg)
5-14
Iterative Structures
• Pretest loop:
while (condition) do
(loop body)• Posttest loop:
repeat (loop body)
until(condition)
![Page 15: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/15.jpg)
5-15
Figure 5.6 The sequential search algorithm in pseudocode
![Page 16: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/16.jpg)
5-16
Figure 5.7 Components of repetitive control
![Page 17: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/17.jpg)
5-17
Figure 5.8 The while loop structure
![Page 18: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/18.jpg)
5-18
Figure 5.9 The repeat loop structure
![Page 19: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/19.jpg)
5-19
Figure 5.10 Sorting the list Fred, Alex, Diana, Byron, and Carol alphabetically
![Page 20: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/20.jpg)
5-20
Figure 5.11 The insertion sort algorithm expressed in pseudocode
![Page 21: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/21.jpg)
5-21
Recursion
• The execution of a procedure leads to another execution of the procedure.
• Multiple activations of the procedure are formed, all but one of which are waiting for other activations to complete.
![Page 22: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/22.jpg)
5-22
Figure 5.12 Applying our strategy to search a list for the entry John
![Page 23: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/23.jpg)
5-23
Figure 5.13 A first draft of the binary search technique
![Page 24: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/24.jpg)
5-24
Figure 5.14 The binary search algorithm in pseudocode
![Page 25: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/25.jpg)
5-25
Figure 5.15
![Page 26: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/26.jpg)
5-26
Figure 5.16
![Page 27: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/27.jpg)
5-27
Figure 5.17
![Page 28: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/28.jpg)
5-28
Algorithm Efficiency
• Measured as number of instructions executed
• Big theta notation: Used to represent efficiency classes– Example: Insertion sort is in Θ(n2)
• Best, worst, and average case analysis
![Page 29: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/29.jpg)
5-29
Figure 5.18 Applying the insertion sort in a worst-case situation
![Page 30: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/30.jpg)
5-30
Figure 5.19 Graph of the worst-case analysis of the insertion sort algorithm
![Page 31: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/31.jpg)
5-31
Figure 5.20 Graph of the worst-case analysis of the binary search algorithm
![Page 32: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/32.jpg)
5-32
Software Verification
• Proof of correctness– Assertions
• Preconditions• Loop invariants
• Testing
![Page 33: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/33.jpg)
5-33
Chain Separating Problem
• A traveler has a gold chain of seven links.• He must stay at an isolated hotel for seven
nights.• The rent each night consists of one link from the
chain.• What is the fewest number of links that must be
cut so that the traveler can pay the hotel one link of the chain each morning without paying for lodging in advance?
![Page 34: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/34.jpg)
5-34
Figure 5.21 Separating the chain using only three cuts
![Page 35: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/35.jpg)
5-35
Figure 5.22 Solving the problem with only one cut
![Page 36: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/36.jpg)
5-36
Figure 5.23 The assertions associated with a typical while structure
![Page 37: Chapter 5: 演算法 Algorithms 陳以德助理教授 : 高醫大舊二棟 2101 07-3121101 轉 2586 itchen@kmu.edu.tw](https://reader031.vdocuments.net/reader031/viewer/2022012321/56649f145503460f94c28cee/html5/thumbnails/37.jpg)
5-37
Summery
• 5.1 The Concept of an Algorithm• 5.2 Algorithm Representation• 5.3 Algorithm Discovery• 5.4 Iterative Structures• 5.5 Recursive Structures• 5.6 Efficiency and Correctness