1 / 42

Chapter 2: Algorithm Discovery and Design

Chapter 2: Algorithm Discovery and Design. Invitation to Computer Science, Java Version, Third Edition. Objectives. In this chapter, you will learn about Representing algorithms Examples of algorithmic problem solving. Introduction.

rashida
Télécharger la présentation

Chapter 2: Algorithm Discovery and Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 2: Algorithm Discovery and Design Invitation to Computer Science, Java Version, Third Edition

  2. Objectives In this chapter, you will learn about • Representing algorithms • Examples of algorithmic problem solving Invitation to Computer Science, Java Version, Third Edition

  3. Introduction • This chapter uses four problems to discuss algorithms and algorithmic problem solving • Multiplying two numbers • Searching lists • Finding maxima and minima • Matching patterns Invitation to Computer Science, Java Version, Third Edition

  4. Representing Algorithms • Natural language • Language spoken and written in everyday life • Examples: English, Spanish, Arabic, and so on • Problems with using natural language for algorithms • Verbose • Imprecise • Relies on context and experiences to give precise meaning to a word or phrase Invitation to Computer Science, Java Version, Third Edition

  5. Figure 2.1 The Addition Algorithm of Figure 1.2 Expressed in Natural Language Invitation to Computer Science, Java Version, Third Edition

  6. Representing Algorithms (continued) • High-level programming language • Examples: C++, Java • Problem with using a high-level programming language for algorithms • During the initial phases of design, we are forced to deal with detailed language issues Invitation to Computer Science, Java Version, Third Edition

  7. Figure 2.2 The Beginning of the Addition Algorithm of Figure 1.2 Expressed in a High-Level Programming Language Invitation to Computer Science, Java Version, Third Edition

  8. Pseudocode • English language constructs modeled to look like statements available in most programming languages • Steps presented in a structured manner (numbered, indented, and so on) • No fixed syntax for most operations is required Invitation to Computer Science, Java Version, Third Edition

  9. Pseudocode (continued) • Less ambiguous and more readable than natural language • Emphasis is on process, not notation • Well-understood forms allow logical reasoning about algorithm behavior • Can be easily translated into a programming language Invitation to Computer Science, Java Version, Third Edition

  10. Sequential Operations • Types of algorithmic operations • Sequential • Conditional • Iterative Invitation to Computer Science, Java Version, Third Edition

  11. Sequential Operations (continued) • Computation operations • Example • Set the value of “variable” to “arithmetic expression” • Variable • Named storage location that can hold a data value Invitation to Computer Science, Java Version, Third Edition

  12. Sequential Operations (continued) • Input operations • To receive data values from the outside world • Example • Get a value for r, the radius of the circle • Output operations • To send results to the outside world for display • Example • Print the value of Area Invitation to Computer Science, Java Version, Third Edition

  13. Figure 2.3 Algorithm for Computing Average Miles per Gallon Invitation to Computer Science, Java Version, Third Edition

  14. Conditional and Iterative Operations • Sequential algorithm • Also called straight-line algorithm • Executes its instructions in a straight line from top to bottom and then stops • Control operations • Conditional operations • Iterative operations Invitation to Computer Science, Java Version, Third Edition

  15. Conditional and Iterative Operations (continued) • Conditional operations • Ask questions and choose alternative actions based on the answers • Example • if x is greater than 25 then print x else print x times 100 Invitation to Computer Science, Java Version, Third Edition

  16. Conditional and Iterative Operations (continued) • Iterative operations • Perform “looping” behavior, repeating actions until a continuation condition becomes false • Loop • The repetition of a block of instructions Invitation to Computer Science, Java Version, Third Edition

  17. Conditional and Iterative Operations (continued) • Examples • while j > 0 do set s to s + aj set j to j - 1 • repeat print ak set k to k + 1 until k > n Invitation to Computer Science, Java Version, Third Edition

  18. Figure 2.5 Second Version of the Average Miles per Gallon Algorithm Invitation to Computer Science, Java Version, Third Edition

  19. Conditional and Iterative Operations (continued) • Components of a loop • Continuation condition • Loop body • Infinite loop • The continuation condition never becomes false • An error Invitation to Computer Science, Java Version, Third Edition

  20. Figure 2.7 Third Version of the Average Miles per Gallon Algorithm Invitation to Computer Science, Java Version, Third Edition

  21. Conditional and Iterative Operations (continued) • Pretest loop • Continuation condition tested at the beginning of each pass through the loop • It is possible for the loop body to never be executed • While loop Invitation to Computer Science, Java Version, Third Edition

  22. Conditional and Iterative Operations (continued) • Posttest loop • Continuation condition tested at the end of loop body • Loop body must be executed at least once • Do/While loop Invitation to Computer Science, Java Version, Third Edition

  23. Figure 2.9 Summary of Pseudocode Language Instructions Invitation to Computer Science, Java Version, Third Edition

  24. Examples of Algorithmic Problem Solving • Go Forth and Multiply: Multiply two numbers using repeated addition • Sequential search: Find a particular value in an unordered collection • Find maximum: Find the largest value in a collection of data • Pattern matching: Determine if and where a particular pattern occurs in a piece of text Invitation to Computer Science, Java Version, Third Edition

  25. Example 1: Go Forth and Multiply • Task • Implement an algorithm to multiply two numbers, a and b, using repeated addition • Algorithm outline • Create a loop that executes exactly b times, with each execution of the loop adding the value of a to a running total Invitation to Computer Science, Java Version, Third Edition

  26. Figure 2.10 Algorithm for Multiplication via Repeated Addition Invitation to Computer Science, Java Version, Third Edition

  27. Example 2: Looking, Looking, Looking • Task • Find a particular person’s name from an unordered list of telephone subscribers • Algorithm outline • Start with the first entry and check its name, then repeat the process for all entries Invitation to Computer Science, Java Version, Third Edition

  28. Example 2: Looking, Looking, Looking (continued) • Algorithm discovery • Finding a solution to a given problem • Naïve sequential search algorithm • For each entry, write a separate section of the algorithm that checks for a match • Problems • Only works for collections of exactly one size • Duplicates the same operations over and over Invitation to Computer Science, Java Version, Third Edition

  29. Example 2: Looking, Looking, Looking (continued) • Correct sequential search algorithm • Uses iteration to simplify the task • Refers to a value in the list using an index (or pointer) • Handles special cases (such as a name not found in the collection) • Uses the variable Found to exit the iteration as soon as a match is found Invitation to Computer Science, Java Version, Third Edition

  30. Figure 2.13 The Sequential Search Algorithm Invitation to Computer Science, Java Version, Third Edition

  31. Example 2: Looking, Looking, Looking (continued) • The selection of an algorithm to solve a problem is greatly influenced by the way the data for that problem is organized Invitation to Computer Science, Java Version, Third Edition

  32. Example 3: Big, Bigger, Biggest • Task • Find the largest value from a list of values • Algorithm outline • Keep track of the largest value seen so far (initialized to be the first in the list) • Compare each value to the largest seen so far, and keep the larger as the new largest Invitation to Computer Science, Java Version, Third Edition

  33. Example 3: Big, Bigger, Biggest (continued) • Once an algorithm has been developed, it may itself be used in the construction of other, more complex algorithms • Library • A collection of useful algorithms • An important tool in algorithm design and development Invitation to Computer Science, Java Version, Third Edition

  34. Example 3: Big, Bigger, Biggest (continued) • Find Largest algorithm • Uses iteration and indices as in previous example • Updates location and largest so far when needed in the loop Invitation to Computer Science, Java Version, Third Edition

  35. Figure 2.14 Algorithm to Find the Largest Value in a List Invitation to Computer Science, Java Version, Third Edition

  36. Example 4: Meeting Your Match • Task • Find if and where a pattern string occurs within a longer piece of text • Algorithm outline • Try each possible location of pattern string in turn • At each location, compare pattern characters against string characters Invitation to Computer Science, Java Version, Third Edition

  37. Example 4: Meeting Your Match (continued) • Abstraction • Separating high-level view from low-level details • Key concept in computer science • Makes difficult problems intellectually manageable • Allows piece-by-piece development of algorithms Invitation to Computer Science, Java Version, Third Edition

  38. Example 4: Meeting Your Match (continued) • Top-down design • When solving a complex problem • Create high-level operations in the first draft of an algorithm • After drafting the outline of the algorithm, return to the high-level operations and elaborate each one • Repeat until all operations are primitives Invitation to Computer Science, Java Version, Third Edition

  39. Example 4: Meeting Your Match (continued) • Pattern-matching algorithm • Contains a loop within a loop • External loop iterates through possible locations of matches to pattern • Internal loop iterates through corresponding characters of pattern and string to evaluate match Invitation to Computer Science, Java Version, Third Edition

  40. Figure 2.16 Final Draft of the Pattern-Matching Algorithm Invitation to Computer Science, Java Version, Third Edition

  41. Summary • Algorithm design is a first step in developing an algorithm • Algorithm design must • Ensure the algorithm is correct • Ensure the algorithm is sufficiently efficient • Pseudocode is used to design and represent algorithms Invitation to Computer Science, Java Version, Third Edition

  42. Summary • Pseudocode is readable, unambiguous, and able to be analyzed • Algorithm design is a creative process; uses multiple drafts and top-down design to develop the best solution • Abstraction is a key tool for good design Invitation to Computer Science, Java Version, Third Edition

More Related