# CS 311 Design and Algorithms Analysis - PowerPoint PPT Presentation

PPT – CS 311 Design and Algorithms Analysis PowerPoint presentation | free to download - id: 6d5519-YWU5Z The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
Title:

## CS 311 Design and Algorithms Analysis

Description:

### CS 311 Design and Algorithms Analysis Dr. Mohamed Tounsi mtounsi_at_cis.psu.edu.sa – PowerPoint PPT presentation

Number of Views:82
Avg rating:3.0/5.0
Slides: 46
Provided by: edus57
Category:
Tags:
Transcript and Presenter's Notes

Title: CS 311 Design and Algorithms Analysis

1
CS 311 Design and Algorithms Analysis
• Dr. Mohamed Tounsi
• mtounsi_at_cis.psu.edu.sa

2
Problems and Algorithms
• Abstractly, a problem is just a function
• p Problem instances -gt Solutions
• Example Sorting a list of integers
• Problem instances lists of integers
• Solutions sorted lists of integers
• p L-gt Sorted version of L
• An algorithm for p is a program which computes p.
• There are four related questions which warrant
consideration

3
Problems and Algorithms
• Question 1 Given an algorithm A to solve a
problem p, how good is A?
• Question 2 Given a particular problem p for
which several algorithms are known to exist,
which is best?
• Question 3 Given a problem p, how does one
design good algorithms for p?

4
Algorithm Analysis
• The main focus of algorithm analysis in this
course will be upon the quality of algorithms
• This analysis proceeds in two dimensions
• Time complexity The amount of time which
execution of the algorithm takes, usually
specified as a function of the size of the input
• Space complexity The amount of space (memory)
which execution of the algorithm takes, usually
specified as a function of the size of the input.
• Such analyses may be performed both
experimentally and analytically.

5
Designing Algorithms
• It is important to study the process of designing
good algorithms in the first place.
• There are two principal approaches to algorithm
design.
• By problem Study sorting algorithms, then
scheduling algorithms, etc.
• By strategy Study algorithms by design strategy.
Examples of design strategies include
• Divide-and-conquer
• The greedy method
• Dynamic programming
• Backtracking
• Branch-and-bound

6
Algorithm Definition
Algorithm
Input
Output
An algorithm is a step-by-step procedure
for solving a problem in a finite amount of time.
7
Running Time
• Most algorithms transform input objects into
output objects.
• The running time of an algorithm typically grows
with the input size.
• Average case time is often difficult to
determine.
• We focus on the worst case running time.
• Easier to analyze
• Crucial to applications such as games, finance
and robotics

8
Experimental Studies
• Write a program implementing the algorithm
• Run the program with inputs of varying size and
composition
• Use a method like times() to get an accurate
measure of the actual running time
• Plot the results

9
Limitations of Experiments
• It is necessary to implement the algorithm, which
may be difficult
• Results may not be indicative of the running time
on other inputs not included in the experiment.
• In order to compare two algorithms, the same
hardware and software environments must be used

10
Theoretical Analysis
• Uses a high-level description of the algorithm
• Characterizes running time as a function of the
input size, n.
• Takes into account all possible inputs
• Allows us to evaluate the speed of an algorithm
independent of the hardware/software environment

11
Pseudocode
• High-level description of an algorithm
• More structured than English prose
• Less detailed than a program
• Preferred notation for describing algorithms
• Hides program design issues

12
Pseudocode Details
• Control flow
• if then else
• while do
• repeat until
• for do
• Indentation replaces braces
• Method declaration
• Algorithm method (arg , arg)
• Input
• Output
• Method call
• var.method (arg , arg)
• Return value
• return expression
• Expressions
• Assignment (like ? in Java)
• Equality testing (like ?? in Java)
• n2 Superscripts and other mathematical formatting
allowed

13
The Random Access Machine (RAM) Model
• A CPU
• An potentially unbounded bank of memory cells,
each of which can hold an arbitrary number or
character
• Memory cells are numbered and accessing any cell
in memory takes unit time.

14
Primitive Operations
• Basic computations performed by an algorithm
• Identifiable in pseudocode
• Largely independent from the programming language
• Exact definition not important (we will see why
later)
• Assumed to take a constant amount of time in the
RAM model
• Examples
• Evaluating an expression
• Assigning a value to a variable
• Indexing into an array
• Calling a method
• Returning from a method

15
Counting Primitive Operations
• By inspecting the pseudocode, we can determine
the maximum number of primitive operations
executed by an algorithm, as a function of the
input size
• Algorithm arrayMax(A, n)
• operations
• currentMax ? A0 2
• for i ? 1 to n ? 1 do 2 n
• if Ai ? currentMax then 2(n ? 1)
• currentMax ? Ai 2(n ? 1)
• increment counter i 2(n ? 1)
• return currentMax 1
• Total 7n ? 1

16
Estimating Running Time
• Algorithm arrayMax executes 7n ? 1 primitive
operations in the worst case. Define
• a Time taken by the fastest primitive operation
• b Time taken by the slowest primitive
operation
• Let T(n) be worst-case time of arrayMax. Then a
(7n ? 1) ? T(n) ? b(7n ? 1)
• Hence, the running time T(n) is bounded by two
linear functions

17
Growth Rate of Running Time
• Changing the hardware/ software environment
• Affects T(n) by a constant factor, but
• Does not alter the growth rate of T(n)
• The linear growth rate of the running time T(n)
is an intrinsic property of algorithm arrayMax

18
Growth Rates
• Growth rates of functions
• Linear ? n
• Cubic ? n3
• In a log-log chart, the slope of the line
corresponds to the growth rate of the function

19
Constant Factors
• The growth rate is not affected by
• constant factors or
• lower-order terms
• Examples
• 102n 105 is a linear function
• 105n2 108n is a quadratic function

20
Big-Oh Notation
• Given functions f(n) and g(n), we say that f(n)
is O(g(n)) if there are positive constants c and
n0 such that
• f(n) ? cg(n) for n ? n0
• Example 2n 10 is O(n)
• 2n 10 ? cn
• (c ? 2) n ? 10
• n ? 10/(c ? 2)
• Pick c 3 and n0 10

21
Big-Oh Example
• Example the function n2 is not O(n)
• n2 ? cn
• n ? c
• The above inequality cannot be satisfied since c
must be a constant

22
More Big-Oh Examples
• 7n-2
• 7n-2 is O(n)
• need c gt 0 and n0 ? 1 such that 7n-2 ? cn for n
? n0
• this is true for c 7 and n0 1
• 3n3 20n2 5

3n3 20n2 5 is O(n3) need c gt 0 and n0 ? 1
such that 3n3 20n2 5 ? cn3 for n ? n0 this
is true for c 4 and n0 21
• 3 log n log log n

3 log n log log n is O(log n) need c gt 0 and n0
? 1 such that 3 log n log log n ? clog n for n
? n0 this is true for c 4 and n0 2
23
Big-Oh and Growth Rate
• The big-Oh notation gives an upper bound on the
growth rate of a function
• The statement f(n) is O(g(n)) means that the
growth rate of f(n) is no more than the growth
rate of g(n)
• We can use the big-Oh notation to rank functions
according to their growth rate

f(n) is O(g(n)) g(n) is O(f(n))
g(n) grows more Yes No
f(n) grows more No Yes
Same growth Yes Yes
24
Big-Oh Rules
• If is f(n) a polynomial of degree d, then f(n) is
O(nd), i.e.,
• Drop lower-order terms
• Drop constant factors
• Use the smallest possible class of functions
• Say 2n is O(n) instead of 2n is O(n2)
• Use the simplest expression of the class
• Say 3n 5 is O(n) instead of 3n 5 is O(3n)

25
Asymptotic Algorithm Analysis
• The asymptotic analysis of an algorithm
determines the running time in big-Oh notation
• To perform the asymptotic analysis
• We find the worst-case number of primitive
operations executed as a function of the input
size
• We express this function with big-Oh notation
• Example
• We determine that algorithm arrayMax executes at
most 7n ? 1 primitive operations
• We say that algorithm arrayMax runs in O(n)
time
• Since constant factors and lower-order terms are
eventually dropped anyhow, we can disregard them
when counting primitive operations

26
Computing Prefix Averages
• We further illustrate asymptotic analysis with
two algorithms for prefix averages
• The i-th prefix average of an array X is average
of the first (i 1) elements of X
• Ai (X0 X1 Xi)/(i1)
• Computing the array A of prefix averages of
another array X has applications to financial
analysis

27
• The following algorithm computes prefix averages
in quadratic time by applying the definition

Algorithm prefixAverages1(X, n) Input array X of
n integers Output array A of prefix averages of
X operations A ? new array of n integers
n for i ? 0 to n ? 1 do n s ? X0
n for j ? 1 to i do 1 2 (n ?
1) s ? s Xj 1 2 (n ? 1) Ai
? s / (i 1) n return A 1
28
Arithmetic Progression
• The running time of prefixAverages1 is O(1 2
n)
• The sum of the first n integers is n(n 1) / 2
• There is a simple visual proof of this fact
• Thus, algorithm prefixAverages1 runs in O(n2)
time

29
Prefix Averages (Linear)
• The following algorithm computes prefix averages
in linear time by keeping a running sum

Algorithm prefixAverages2(X, n) Input array X of
n integers Output array A of prefix averages of
X operations A ? new array of n
integers n s ? 0 1 for i ? 0 to n ? 1
do n s ? s Xi n Ai ? s / (i 1)
n return A 1
• Algorithm prefixAverages2 runs in O(n) time

30
Math you need to Review
• Summations
• Logarithms and Exponents
• Proof techniques
• Basic probability
• properties of logarithms
• logb(xy) logbx logby
• logb (x/y) logbx - logby
• logbxa alogbx
• logba logxa/logxb
• properties of exponentials
• a(bc) aba c
• abc (ab)c
• ab /ac a(b-c)
• b a logab
• bc a clogab

31
Relatives of Big-Oh
• big-Omega
• f(n) is ?(g(n)) if there is a constant c gt 0
• and an integer constant n0 ? 1 such that
• f(n) ? cg(n) for n ? n0
• big-Theta
• f(n) is ?(g(n)) if there are constants c gt 0 and
c gt 0 and an integer constant n0 ? 1 such that
cg(n) ? f(n) ? cg(n) for n ? n0
• little-oh
• f(n) is o(g(n)) if, for any constant c gt 0, there
is an integer constant n0 ? 0 such that f(n) ?
cg(n) for n ? n0
• little-omega
• f(n) is ?(g(n)) if, for any constant c gt 0, there
is an integer constant n0 ? 0 such that f(n) ?
cg(n) for n ? n0

32
Intuition for Asymptotic Notation
• Big-Oh
• f(n) is O(g(n)) if f(n) is asymptotically less
than or equal to g(n)
• big-Omega
• f(n) is ?(g(n)) if f(n) is asymptotically greater
than or equal to g(n)
• big-Theta
• f(n) is ?(g(n)) if f(n) is asymptotically equal
to g(n)
• little-oh
• f(n) is o(g(n)) if f(n) is asymptotically
strictly less than g(n)
• little-omega
• f(n) is ?(g(n)) if is asymptotically strictly
greater than g(n)

33
Example Uses of the Relatives of Big-Oh
• 5n2 is ?(n2)

f(n) is ?(g(n)) if there is a constant c gt 0 and
an integer constant n0 ? 1 such that f(n) ?
cg(n) for n ? n0 let c 5 and n0 1
• 5n2 is ?(n)

f(n) is ?(g(n)) if there is a constant c gt 0 and
an integer constant n0 ? 1 such that f(n) ?
cg(n) for n ? n0 let c 1 and n0 1
• 5n2 is ?(n)

f(n) is ?(g(n)) if, for any constant c gt 0, there
is an integer constant n0 ? 0 such that f(n) ?
cg(n) for n ? n0 need 5n02 ? cn0 ? given c, the
n0 that satifies this is n0 ? c/5 ? 0
34
Best Worst and Average Case
• The worst case complexity of the algorithm is the
function defined by the maximum number of steps
taken on any instance of size n
• The best case complexity of the algorithm is the
function defined by the minimum number of steps
taken on any instance of size n
• Each of these complexities defines a numerical
function time vs size

35
Best Worst and Average Case (cont.)
36
Exact Analysis is Hard !!
• We have agreed that the best, worst and average
case complexity of an algorithm is a numerical
function of the size of the instances
• However it is difficult to work with exactly
because it is typically very complicated
• Thus it is usually cleaner and easier to talk
about upper and lower bounds of the function
• This is where the big O notation comes in

37
Formalization of the Concept of Order
• The next task is to formalize the notion of one
function being more difficult to compute than
another, subject to the following assumptions
• The argument n defining the instance size is
sufficiently large
• Positive constant multipliers are ignored.

38
Formalization of Concepts (cont)
• Definition Let f
• Complexity functions will never be negative for
usable arguments.
• In any case, behavior before no is not
significant for the asymptotic mathematical
analysis.

39
Big O Notation
• Definition Let f
• It is said that g is big-oh of f .
• We write g O( f ) or g in O( f )
• The intuition is that g is smaller than f
i.e., that g represents a lesser complexity.

40
?, ? and ?
• The value of n0 shown is the minimum possible
value (any greater value would also work

41
Sequential Search
• void seqsearch(int n,
• const keytype S ,
• keytype x,
• index location)
• location 1
• while (location lt n Slocation ! x)
• location
• if (location gt n)
• location0
• T(n) N

42
Binary Search
• void binsearch (int n,
• const keytype S,
• keytype x,
• index location)
• index low, high, mid
• low 1 high n
• location 0
• while (low lt high location 0)
• mid ?(low high)/2?
• if (x Smid)
• location mid
• else if (x lt S mid )
• high mid - 1
• else
• low mid 1

43
Matrix Multiplication
• void matrixmult (int n,
• const number A,
• const number B,
• number C)
• index i, j, k
• for (i1 jlt n j)
• for (j1 jlt n j)
• C i j 0
• for (k1 klt n k)
• C i j C i j
• A i k B k j

44
Exchange Sort
• void exchangesort (int n,
• keytype S)
• index i, j
• for (i1ilt 1 i)
• for (jil jlt n j)
• if (Sj lt Si)
• exchange Si and Sj

45