Chapter 1
Chapter 1
BASIC CONCEPT
CHAPTER 1 1
How to create programs
Requirements
Analysis: bottom-up vs. top-down
Design: data objects and operations
Refinement and Coding
Verification
– Correctness Proof
– Testing
– Error Removal
CHAPTER 1 2
Algorithm
Definition
An algorithm is a finite set of instructions that accomplishes a particular task.
Criteria
– input
– output
– definiteness: clear and unambiguous
– finiteness: terminate after a finite number of steps
– effectiveness: instruction is basic enough to be carried out
CHAPTER 1 3
Measurements
Criteria
– Is it correct?
– Is it readable?
– …
Performance Analysis (machine independent)
– space complexity: storage requirement
– time complexity: computing time
Performance Measurement (machine dependent)
CHAPTER 1 4
Space Complexity
S(P)=C+SP(I)
Fixed Space Requirements (C)
Independent of the characteristics of the inputs and outputs
– instruction space
– space for simple variables, fixed-size structured variable, constants
Variable Space Requirements (SP(I))
depend on the instance characteristic I
– number, size, values of inputs and outputs associated with I
– recursive stack space, formal parameters, local variables, return address
CHAPTER 1 5
*Program 1.9: Simple arithmetic function (p.19)
float abc(float a, float b, float c)
{
return a + b + b * c + (a + b - c) / (a + b) + 4.00;
}
Sabc(I) = 0
Assumptions:
*Figure 1.1: Space needed for one recursive call of Program 1.11 (p.21)
CHAPTER 1 7
Time Complexity
T(P)=C+TP(I)
Compile time (C)
independent of instance characteristics
run (execution) time TP
Definition
A program step is a syntactically or semantically meaningful program segment whose execution time is
independent of the instance characteristics.
Example
– abc = a + b + b * c + (a + b - c) / (a + b) + 4.0
– abc = a + b + c
T (n)=caADD(n)+csSUB(n)+clLDA(n)+cstSTA(n)
P
CHAPTER 1 9
Iterative summing of a list of numbers
*Program 1.12: Program 1.10 with count statements (p.23)
CHAPTER 1 11
Recursive summing of a list of numbers
*Program 1.14: Program 1.11 with count statements added (p.24)
CHAPTER 1 12
Matrix addition
CHAPTER 1 13
*Program 1.16: Matrix addition with count statements (p.25)
CHAPTER 1 16
Recursive Function to sum of a list of numbers
*Figure 1.3: Step count table for recursive summing function (p.27)
CHAPTER 1 17
Matrix Addition
*Figure 1.4: Step count table for matrix addition (p.27)
CHAPTER 1 18
Exercise 1
CHAPTER 1 19
Exercise 2
CHAPTER 1 20
Exercise 3
*Program 1.20:Matrix product function(p.29)
CHAPTER 1 21
Exercise 4
CHAPTER 1 22
Asymptotic Notation (O)
Definition
f(n) = O(g(n)) iff there exist positive constants c and n0 such that f(n) cg(n) for all n, n n0.
Examples
– 3n+2=O(n) /* 3n+24n for n2 */
– 3n+3=O(n) /* 3n+34n for n3 */
– 100n+6=O(n) /* 100n+6101n for n10 */
– 10n2+4n+2=O(n2) /* 10n2+4n+211n2 for n5 */
– 6*2n+n2=O(2n) /* 6*2n+n2 7*2n for n4 */
CHAPTER 1 23
Example
Complexity of c1n2+c2n and c3n
– for sufficiently large of value, c3n is faster than
c1n2+c2n
– for small values of n, either could be faster
• c1=1, c2=2, c3=100 --> c1n2+c2n c3n for n 98
• c1=1, c2=2, c3=1000 --> c1n2+c2n c3n for n 998
– break even point
• no matter what the values of c1, c2, and c3, the n beyond
which c3n is always faster than c1n2+c2n
CHAPTER 1 24
O(1): constant
O(n): linear
O(n2): quadratic
O(n3): cubic
O(2n): exponential
O(logn)
O(nlogn)
CHAPTER 1 25
*Figure 1.7:Function values (p.38)
CHAPTER 1 26
*Figure 1.8:Plot of function values(p.39)
nlogn
logn
CHAPTER 1 27
*Figure 1.9:Times on a 1 billion instruction per second computer(p.40)
CHAPTER 1 28