Scribd
Upload
66 views

05 Algorithms

This document contains lecture slides on algorithms from International University's School of Computer Science and Engineering. It discusses the concept of algorithms, ways to represent algorithms using pseudocode, techniques for discovering algorithms like stepwise refinement and working problems backwards, iterative and recursive structures for algorithms, and analyzing an algorithm's efficiency and correctness. The key topics covered include representations of algorithms, iterative loops, recursive functions, analyzing best/worst case efficiency using Big O notation, and verifying algorithms using assertions and testing.

Uploaded by

Trung Tran
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
66 views

05 Algorithms

This document contains lecture slides on algorithms from International University's School of Computer Science and Engineering. It discusses the concept of algorithms, ways to represent algorithms using pseudocode, techniques for discovering algorithms like stepwise refinement and working problems backwards, iterative and recursive structures for algorithms, and analyzing an algorithm's efficiency and correctness. The key topics covered include representations of algorithms, iterative loops, recursive functions, analyzing best/worst case efficiency using Big O notation, and verifying algorithms using assertions and testing.

Uploaded by

Trung Tran
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 46

International University, School of Computer Science

VNU-HCM & Engineering

IT101- Introduction to Computing

Lect. 5: Algorithms

Fall 2015

INTERNATIONAL UNIVERSITY, VNU-HCM 1


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

INTERNATIONAL UNIVERSITY, VNU-HCM 2


5.1 The Concept of an Algorithm

INTERNATIONAL UNIVERSITY, VNU-HCM 3


Definition of Algorithm
An algorithm is an ordered set of
unambiguous, executable steps that
defines a terminating process.

INTERNATIONAL UNIVERSITY, VNU-HCM 4


5.2 Algorithm Representation

INTERNATIONAL UNIVERSITY, VNU-HCM 5


Algorithm Representation
Requires well-defined primitives
A collection of primitives constitutes a programming language.

INTERNATIONAL UNIVERSITY, VNU-HCM 6


Pseudocode Primitives
 A notation resembling a simplified
programming language, used in program
design.
 Assignment
name = expression

 Example
RemainingFunds = CheckingBalance +

SavingsBalance
INTERNATIONAL UNIVERSITY, VNU-HCM 7
Pseudocode Primitives
(continued)
 Conditional selection
if (condition):
activity
 Example
if (sales have decreased):
low er the price by 5%

INTERNATIONAL UNIVERSITY, VNU-HCM 8


Pseudocode Primitives
(continued)
 Conditional selection
if (condition):
activity
else:
activity

 Example
if (year is leap year):
daily total= total/ 366
else:
daily total= total/ 365
INTERNATIONAL UNIVERSITY, VNU-HCM 9
Pseudocode Primitives
(continued)
 Repeated execution
w hile (condition):
body

 Example
w hile (tickets rem ain to be sold):
sella ticket

INTERNATIONAL UNIVERSITY, VNU-HCM 10


Pseudocode Primitives
(continued)
 Indentation shows nested conditions
if (not raining):
if (tem perature = = hot):
go sw im m ing
else:
play golf
else:
w atch television

INTERNATIONAL UNIVERSITY, VNU-HCM 11


Pseudocode Primitives
(continued)
 Define a function
def nam e():

 Example
def ProcessLoan():

 Executing a function
if (. . .):
ProcessLoan()
else:
RejectApplication()
INTERNATIONAL UNIVERSITY, VNU-HCM 12
The procedure Greetings in pseudocode

def G reetings():
Count = 3
w hile (Count > 0):
print('H ello')
Count = Count - 1

INTERNATIONAL UNIVERSITY, VNU-HCM 13


Pseudocode Primitives
(continued)
 Using parameters
def Sort(List):
.
.
 Executing Sort on different lists
Sort(the m em bership list)
Sort(the w edding guest list)

INTERNATIONAL UNIVERSITY, VNU-HCM 14


5.3 Algorithm Discovery

INTERNATIONAL UNIVERSITY, VNU-HCM 15


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.

INTERNATIONAL UNIVERSITY, VNU-HCM 16


Polya’s Steps in the Context of
Program Development
1. Understand the problem.
2. Get an idea of how an algorithmic function might solve the
problem.
3. Formulate the algorithm and represent it as a program.
4. Evaluate the solution for accuracy and its potential as a tool for
solving other problems.

INTERNATIONAL UNIVERSITY, VNU-HCM 17


Getting a Foot in the Door
 Try working the problem backwards
 Solve an easier related problem
o Relax some of the problem constraints
o Solve pieces of the problem first (bottom up methodology)

 Stepwise refinement: Divide the problem into


smaller problems (top-down methodology)

INTERNATIONAL UNIVERSITY, VNU-HCM 18


Ages of Children Problem
 Person A is charged with the task of
determining the ages of B’s three children.
oB tells A that the product of the children’s ages is 36.
oA replies that another clue is required.
oB tells A the sum of the children’s ages.
oA replies that another clue is needed.
oB tells A that the oldest child plays the piano.
oA tells B the ages of the three children.

 How old are the three children?

INTERNATIONAL UNIVERSITY, VNU-HCM 19


Figure 5.5

INTERNATIONAL UNIVERSITY, VNU-HCM 20


5.4 Iterative Structures

INTERNATIONAL UNIVERSITY, VNU-HCM 21


The sequential search algorithm in
pseudocode

def Search (List, TargetValue):


if (List is em pty):
D eclare search a failure
else:
Select the fi rst entry in List to be TestEntry
w hile (TargetValue > TestEntry and entries rem ain):
Select the next entry in List as TestEntry
if (TargetValue = = TestEntry):
D eclare search a success
else:
D eclare search a failure

INTERNATIONAL UNIVERSITY, VNU-HCM 22


Components of repetitive control

INTERNATIONAL UNIVERSITY, VNU-HCM 23


Iterative Structures
 Pretest loop:
w hile (condition):
body
 Posttest loop:
repeat:
body
until(condition)

INTERNATIONAL UNIVERSITY, VNU-HCM 24


The while loop structure

INTERNATIONAL UNIVERSITY, VNU-HCM 25


The repeat loop structure

INTERNATIONAL UNIVERSITY, VNU-HCM 26


Sorting the list Fred, Alex, Diana, Byron, and Carol alphabetically

INTERNATIONAL UNIVERSITY, VNU-HCM 27


The insertion sort algorithm expressed in
pseudocode

def Sort(List):
N = 2
w hile (N < = length of List):
Pivot = N th entry in List
Rem ove N th entry leaving a hole in List
w hile (there is an Entry above the
hole and Entry > Pivot):
M ove Entry dow n into the hole leaving
a hole in the list above the Entry
M ove Pivot into the hole
N = N + 1

INTERNATIONAL UNIVERSITY, VNU-HCM 28


5.5 Recursive Structures

INTERNATIONAL UNIVERSITY, VNU-HCM 29


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.

INTERNATIONAL UNIVERSITY, VNU-HCM 30


Applying our strategy to search a list for the
entry John

INTERNATIONAL UNIVERSITY, VNU-HCM 31


A first draft of the binary search
technique

if (List is em pty):
Report that the search failed
else:
TestEntry = m iddle entry in the List
if (TargetValue = = TestEntry):
Report that the search succeeded
if (TargetValue < TestEntry):
Search the portion of List preceding TestEntry for
TargetValue, and report the result of that search
if (TargetValue > TestEntry):
Search the portion of List follow ing TestEntry for
TargetValue, and report the result of that search

INTERNATIONAL UNIVERSITY, VNU-HCM 32


The binary search algorithm in
pseudocode

def Search(List, TargetValue):


if (List is em pty):
Report that the search failed
else:
TestEntry = m iddle entry in the List
if (TargetValue = = TestEntry):
Report that the search succeeded
if (TargetValue < TestEntry):
Sublist = portion of List preceding TestEntry
Search(Sublist, TargetValue)
if (TargetValue < TestEntry):
Sublist = portion of List follow ing TestEntry
Search(Sublist, TargetValue)

INTERNATIONAL UNIVERSITY, VNU-HCM 33


Figure 5.15

INTERNATIONAL UNIVERSITY, VNU-HCM 34


Figure 5.16

INTERNATIONAL UNIVERSITY, VNU-HCM 35


Figure 5.17

INTERNATIONAL UNIVERSITY, VNU-HCM 36


5.6 Efficiency and
Correctness

INTERNATIONAL UNIVERSITY, VNU-HCM 37


Algorithm Efficiency
 Measured as number of instructions executed
 Big theta notation: Used to represent efficiency classes
o Example: Insertion sort is in Θ(n2)

 Best, worst, and average case analysis

INTERNATIONAL UNIVERSITY, VNU-HCM 38


Applying the insertion sort in a worst-case
situation

INTERNATIONAL UNIVERSITY, VNU-HCM 39


Graph of the worst-case analysis of the insertion sort algorithm

INTERNATIONAL UNIVERSITY, VNU-HCM 40


Graph of the worst-case analysis of the binary search algorithm

INTERNATIONAL UNIVERSITY, VNU-HCM 41


Software Verification
 Proof of correctness
o Assertions
• Preconditions
• Loop invariants
o Testing

INTERNATIONAL UNIVERSITY, VNU-HCM 42


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?

INTERNATIONAL UNIVERSITY, VNU-HCM 43


Separating the chain using
only three cuts

INTERNATIONAL UNIVERSITY, VNU-HCM 44


Solving the problem with only
one cut

INTERNATIONAL UNIVERSITY, VNU-HCM 45


The assertions associated with a typical while structure

INTERNATIONAL UNIVERSITY, VNU-HCM 46

You might also like