Lec03-TimeComplexityBigONotation MaximumSumSubarray
Lec03-TimeComplexityBigONotation MaximumSumSubarray
Lec03-TimeComplexityBigONotation MaximumSumSubarray
(ESO207)
Lecture 3:
• Time complexity, Big “O” notation
• Designing Efficient Algorithm
• Maximum sum subarray Problem
1
Three algorithms
Algorithm for F(𝑛)mod 𝑚 No. Instructions in RAM model
IterFib(𝑛,𝑚) 3𝑛
Clever_Algo_Fib(𝑛,𝑚) 35 𝐥𝐨𝐠 $ (𝑛 − 1) + 11
2
Lesson 1
from Assignment 1 ?
No. of instructions executed by
algorithm in RAM model
Pro po
?rtio nal
to
May
be diffe
?for different in
rent
3
Time complexity of an algorithm
Definition:
the worst case number of instructions executed
as a function of the input size (or a parameter defining the input size)
4
Example:
Whether an array A storing 𝑗 numbers (each stored in a word) is sorted ?
IsSorted(A)
{ 𝑖ß1; 𝟏 time
flagß true; 𝟏 time
while(𝑖 < 𝒋 and flag==true)
{
If (A[𝑖]< A[𝑖 − 1]) flagßfalse ; 𝒋 − 𝟏 times in the worst case
𝑖 ß 𝑖 + 1;
}
Return flag ; 𝟏 time
}
Time complexity = 𝟐𝒋 + 𝟏
5
Example:
Time complexity of matrix multiplication
Each element of the matrices
Matrix-mult(C[𝑛, 𝑛],D[𝑛, 𝑛]) occupies one word of RAM.
{ for 𝑖 = 0 to 𝒏 − 𝟏 𝒏 times
{ for 𝑗 = 0 to 𝒏 − 𝟏 𝒏 times
{ M[𝑖, 𝑗] ß 0;
for 𝑘 = 0 to 𝒏 − 𝟏
{ M[𝑖, 𝑗]ß M[𝑖, 𝑗] + C[𝑖, 𝑘]*D[𝑘, 𝑗]; 𝒏 + 𝟏 instructions
}
}
}
Return M 𝟏 time
}
Time complexity = 𝒏𝟑 + 𝒏𝟐 + 𝟏
6
Lesson 2 learnt from Assignment 1 ?
IterFib(𝑛,𝑚) 3𝑛
Clever_Algo_Fib(𝑛,𝑚) 100
35 𝐥𝐨𝐠 $ (𝑛 − 1) + 11
1000
Answer: Clever_Algo_Fib would still be the fastest algorithm ...for large value of 𝑛.
7
COMPARING EFFICIENCY OF ALGORITHMS
8
Comparing efficiency of two algorithms
Let A and B be two algorithms to solve a given problem.
9
Comparing efficiency of two algorithms
Let A and B be two algorithms to solve a given problem.
Question: Which one would you prefer based on the efficiency criteria ?
Answer : A is more efficient than B for 𝑛 < 25
B is more efficient than A for 𝑛 > 25
Time complexity is
really an issue only
when the input is of
large size
10
Rule 1
11
Comparing efficiency of two algorithms
12
A judgment question for you !
Algorithm A has time complexity f(𝑛)= 5 𝑛! + 𝑛 + 1250
Researchers have designed two new algorithms B and C
Which of B and C is an
improvement over A in the
true sense ?
𝐠(7) 𝐡(7)
lim = 1/5 lim ?
=0
7→9 𝐟(7) 7→9 𝐟(7)
C is an improvement over A
in the true sense.
13
Rule 2
14
Some Observations
Algorithm A has time complexity f(𝑛)= 5 𝑛! + 𝑛 + 1250
Researchers have designed two new algorithms B and C
Observation 1:
multiplicative or additive Constants do not play any role.
Observation 2:
The highest order term governs the time complexity asymptotically.
15
ORDER NOTATIONS
A mathematical way
to capture the intuitions developed till now.
(reflect upon it yourself)
16
Order notation
Definition: Let f(𝑛) and g(𝑛) be any two increasing functions of n.
f(𝑛) is said to be of the order of g(𝑛)
if there exist constants c and 𝑛% such that
f(𝑛) ≤ c g(𝑛) for all n > 𝑛%
c g(𝑛)
f(𝑛)
𝑛)
Homeworks:
• g(𝑛) = 2" , f(𝑛) = 3" . Is f(𝑛) = O(g(𝑛)) ? Give proof.
• What is the time complexity of selection sort on an array storing n elements ?
• What is the time complexity of Binary search in a sorted array of n elements ?
19
HOW TO DESIGN EFFICIENT ALGORITHM ?
20
Designing an efficient algorithm
4 7
A 3 -5 3 8 2 -4 9 -6 3 -2 -8 3 -5 1 7 -9
18 -2
22
Max-sum subarray problem:
A trivial algorithm
A_trivial_algo(A)
{ maxß A[0];
For i=0 to n-1
For j=i to n-1
{ temp ß compute_sum(A,i,j);
if max< temp then maxß temp;
}
return max;
} Homework: Prove that its
time complexity is O(𝑛* )
compute_sum(A, i,j)
{ sumßA[i];
For k=i+1 to j sumß sum+A[k];
return sum;
23
}
Max-sum subarray problem:
Question: Can we design O(𝑛) time algorithm for Max-sum subarray problem ?
Answer: Yes.
24