![Page 1: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/1.jpg)
Chapter 5
Algorithms
![Page 2: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/2.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-2
Chapter 5: Algorithms
• 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. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/3.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-3
Algorithm: definition
• An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process.
![Page 4: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/4.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-4
Algorithms: levels of abstraction
• Problem = motivation for algorithm
• Algorithm = procedure to solve the problem– Often one of many possibilities
• Representation = description of algorithm sufficient to communicate it to the desired audience– Always one of many possibilities
![Page 5: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/5.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-5
Figure 5.2 Folding a bird from a square piece of paper
![Page 6: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/6.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-6
Figure 5.3 Origami primitives
![Page 7: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/7.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-7
Pseudocode primitives
• Assignment name expression
• Conditional selection if condition then action
• Repeated execution while condition do activity
• Procedure procedure name (generic names)
![Page 8: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/8.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-8
Figure 5.4 The procedure Greetings in pseudocode
![Page 9: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/9.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-9
Figure 5.6 The sequential search algorithm in pseudocode
![Page 10: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/10.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-10
Problem solving steps
• 1. Understand the problem.
• 2. Get an idea how an algorithmic procedure might solve the problem.
• 3. Formulate the algorithm and represent it as a program.
• 4. Evaluate the program for accuracy and its potential as a tool for solving other problems.
![Page 11: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/11.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-11
Techniques for “getting a foot in the door”
• Work 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 = top-down methodology– Popular technique because it produces modular
programs
![Page 12: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/12.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-12
Sample 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. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/13.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-13
Figure 5.5
![Page 14: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/14.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-14
Figure 5.7 Components of repetitive control
![Page 15: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/15.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-15
Figure 5.8 The while loop structure
![Page 16: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/16.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-16
Figure 5.9 The repeat loop structure
![Page 17: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/17.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-17
Figure 5.10 Sorting the list Fred, Alex, Diana, Byron, and Carol alphabetically
![Page 18: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/18.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-18
Figure 5.11 The insertion sort algorithm expressed in pseudocode
![Page 19: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/19.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-19
Figure 5.12 Applying our strategy to search a list for the entry John
![Page 20: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/20.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-20
Figure 5.13 A first draft of the binary search technique
![Page 21: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/21.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-21
Figure 5.14 The binary search algorithm in pseudocode
![Page 22: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/22.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-22
Figure 5.15
![Page 23: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/23.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-23
Figure 5.16
![Page 24: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/24.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-24
Figure 5.17
![Page 25: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/25.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-25
Software efficiency
• Measured as number of instructions executed
• notation for efficiency classes– Example: insertion sort is (n2)
• Best, worst, and average case
![Page 26: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/26.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-26
Figure 5.18 Applying the insertion sort in a worst-case situation
![Page 27: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/27.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-27
Figure 5.19 Graph of the worst-case analysis of the insertion sort algorithm
![Page 28: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/28.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-28
Figure 5.20 Graph of the worst-case analysis of the binary search algorithm
![Page 29: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/29.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-29
Software verification
• Proof of correctness– Assertions
• Preconditions
• Loop invariants
• Testing
![Page 30: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/30.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-30
Example problem: Chain separating
• 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 31: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/31.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-31
Figure 5.21 Separating the chain using only three cuts
![Page 32: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/32.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-32
Figure 5.22 Solving the problem with only one cut
![Page 33: Chapter 5 Algorithms. © 2005 Pearson Addison-Wesley. All rights reserved 5-2 Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation](https://reader035.vdocuments.net/reader035/viewer/2022062408/56649f145503460f94c28cd9/html5/thumbnails/33.jpg)
© 2005 Pearson Addison-Wesley. All rights reserved5-33
Figure 5.23 The assertions associated with a typical while structure