Professional Documents
Culture Documents
Design and Analysis of Algorithms Tutorial Assignment No 1.1 Algorithms Basics and Analysis Techniques
Design and Analysis of Algorithms Tutorial Assignment No 1.1 Algorithms Basics and Analysis Techniques
Pseudo code:
Sum_of_n_number(array[], n)
Let sum = 0;
For i=0 to n sum=sum
+ array[i];
CSPIT-IT 1|Page
DAA 5IT-2 19IT128
Analysis:
COST CODE NO. OF TIMES
EXECUTED
C1 Sum=0 1
C2 For i=0 to n n+1
C3 Sum=sum + array[i]; n
C4 Print(sum) 1
Mathematical analysis for sum of n numbers from
array: Time complexity = O((C1*1)+(C2*n+1)+(C3*n)
+(C4*1))
= O(1+n+1+n+1)
=O(2n+3)
=O(n)
3. perform the bubble
sort.
Pseudo code:
Bubblesort(array[] n)
Let i=0, temp= 0;
While i<=n-1
For j=0 to j<=n-i
If(array[i]>array[j+1])
temp=array[j] array[j]=array[j+1]
array[j+1]=temp Analysis:
CSPIT-IT 2|Page
DAA 5IT-2 19IT128
Pseudo code:
Minimum_element(array[],n)
Let minimum = 999;
For i=0 to n if(array[i] <
minimum) minimum =
array[i];
return minimum;
Analysis:
CSPIT-IT 3|Page
DAA 5IT-2 19IT128
Pseudo code:
factorial(n)
Let n=5,
fact=1;
For i=1 to n
fact = fact*i;
return fact;
Analysis:
CSPIT-IT 4|Page
DAA 5IT-2 19IT128
Pseudo code:
Fibonacc_numberi(n)
let pre=0,next=1,sum
= 0; print(pre , next)
For i=2 to n sum =
pre+next;
print(sum);
pre = next;
next = sum;
Analysis:
COST CODE NO. OF TIMES
EXECUTED
C1 pre=0,next=1,sum = 0; 1
CSPIT-IT 5|Page
DAA 5IT-2 19IT128
Pseudo code:
Insertion(array[],n)
For j=1 to n; Key = array[j]; i = j-
1; while( j > 0 and array[i]
> key) array[i+1] =
array[i] i=i-1;
array[i+1] = key;
Analysis:
COST CODE NO. OF TIMES
EXECUTED
C1 For j=1 to n; n+1
C2 Key = array[j]; n
C3 i = j-1; n
CSPIT-IT 6|Page
DAA 5IT-2 19IT128
Time complexity = =
O((C1*(n+1))+(C2*n)+(C3*(n))+(C4*(n*(n+1))+(C5*(n2))+(C6 *n2)+(C7*1))
= O(n+1+n+n+n2+n+ n2+ n2+ n2)
= O(4n2+4n+1)
= O(n2)
-
CSPIT-IT 7|Page