Scribd
Upload
14 views36 pages

5 Algorithm

This document discusses algorithms and their representation. It defines an algorithm as an ordered set of steps that defines a terminating process. It describes different ways to represent algorithms, including with pseudocode using primitives like assignment, conditionals, and procedures. It also discusses iterative and recursive structures for algorithms, including loops and procedures that call themselves. The document explores analyzing algorithms for efficiency based on things like runtime and best, worst, and average cases. It emphasizes the importance of proving algorithms are correct through assertions and testing.

Uploaded by

coco fina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views36 pages

5 Algorithm

This document discusses algorithms and their representation. It defines an algorithm as an ordered set of steps that defines a terminating process. It describes different ways to represent algorithms, including with pseudocode using primitives like assignment, conditionals, and procedures. It also discusses iterative and recursive structures for algorithms, including loops and procedures that call themselves. The document explores analyzing algorithms for efficiency based on things like runtime and best, worst, and average cases. It emphasizes the importance of proving algorithms are correct through assertions and testing.

Uploaded by

coco fina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 36

Algorithms

Computer Science: An Overview


Tenth Edition

by
Kai-Lung Hua
Algorithms

• 1 The Concept of an Algorithm


• 2 Algorithm Representation
• 3 Algorithm Discovery
• 4 Iterative Structures
• 5 Recursive Structures
• 6 Efficiency and Correctness

5-2
Definition of Algorithm

An algorithm is an ordered set of


unambiguous, executable steps
that defines a terminating process.

5-3
Algorithm Representation

• Requires well-defined primitives


• A collection of primitives constitutes a
programming language.

5-4
Figure 5.2 Folding a bird from a
square piece of paper

5-5
Figure 5.3 Origami primitives

5-6
Pseudocode Primitives

• Assignment
name  expression

• Conditional selection
if condition then action

5-7
Pseudocode Primitives (continued)

• Repeated execution
while condition do activity

• Procedure
procedure name (generic names)

5-8
Figure 5.4 The procedure Greetings
in pseudocode

5-9
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.

5-10
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)

5-11
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?

5-12
Figure 5.5

5-13
Iterative Structures

• Pretest loop:
while (condition) do
(loop body)
• Posttest loop:
repeat (loop body)
until(condition)

5-14
Figure 5.6 The sequential search
algorithm in pseudocode

5-15
Figure 5.7 Components of repetitive
control

5-16
Figure 5.8 The while loop structure

5-17
Figure 5.9 The repeat loop structure

5-18
Figure 5.10 Sorting the list Fred, Alex,
Diana, Byron, and Carol alphabetically

5-19
Figure 5.11 The insertion sort
algorithm expressed in pseudocode

5-20
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.

5-21
Figure 5.12 Applying our strategy to
search a list for the entry John

5-22
Figure 5.13 A first draft of the binary
search technique

5-23
Figure 5.14 The binary search
algorithm in pseudocode

5-24
Figure 5.15

5-25
Figure 5.16

5-26
Figure 5.17

5-27
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

5-28
Figure 5.18 Applying the insertion sort in
a worst-case situation

5-29
Figure 5.19 Graph of the worst-case
analysis of the insertion sort algorithm

5-30
Figure 5.20 Graph of the worst-case
analysis of the binary search algorithm

5-31
Software Verification

• Proof of correctness
– Assertions
• Preconditions
• Loop invariants
• Testing

5-32
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?

5-33
Figure 5.21 Separating the chain
using only three cuts

5-34
Figure 5.22 Solving the problem with
only one cut

5-35
Figure 5.23 The assertions associated
with a typical while structure

5-36

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy