About This Blog

Hello,This blog is all about Design Annalysis of Algorithm(DAA)  basics and practicals by Deepak Shah.

 Stay Tuned.😃💓

Comments

Post a Comment

Popular posts from this blog

Write user defined functions for the following sorting methods and compare their performance by time measurement with random data and Sorted data.

Image
SELECTION SORT: #include<stdio.h> #include<conio.h> #include<math.h> #include<time.h> #define n 10000 void selection_sort(int[]); unsigned long int count=0; void main() {             int a[n];             int choice,i;             clrscr();             printf("1.Sorted Data  2.Random Data \n");             scanf("%d",&choice);             switch(choice)             {                         case 1:                                     for(i=0;i<n;i++)                                     {                                                 a[i]=i+1;                                     }                                     selection_sort(a);                                     break;                         case 2:                                     for(i=0;i<n;i++)                                     {                                                 a[i]=n-i;               
Read more

Implement functions to print nth Fibonacci number using iteration and recursive method.

Image
Implement functions to print nth Fibonacci number using iteration and recursive method. Compare the performance of two methods by counting number of steps executed on various inputs. Also draw a comparative chart. (Fibonacci series 1, 1, 2, 3, 5, 8…..  Here 8 is the 6th Fibonacci number) #include<stdio.h> #include<conio.h> int iteration(int); int recursive(int); int count=0; void main() { int n,choice,ans; clrscr(); printf("\nenter nth number : "); scanf("%d",&n); printf(“\n==iteration==”); ans=iteration(n); printf(“\nans=%d\ncount=%d”,ans,count); printf(“\n\n==recursive==”); ans=recursive(n); printf("\nans=%d\ncount=%d",ans,count); getch(); } int iteration(int n) { int f=1,s=1,t,i; count++;   count++; for(i=3;i<=n;i++) { t=f+s; count++; f=s; count++; s=t; count++; } count++; return t; } int recursive(int n) { count++; if(n==0 || n==1) { cou
Read more

Implement program of Counting Sort.

#include<stdio.h> #include<stdlib.h> #include<math.h> #include<conio.h> long int cnt=0; void Counting_Sort(int *a,intn,int *b) { cnt++; int max=a[0],i,j,*c; cnt++; for (i = 0; i < n; i++) { cnt+=2; if (a[i] > max) { cnt++; max = a[i]; } } cnt++; c=(int *)malloc((max+1)*sizeof(int)); cnt++; for(i=0;i<max;i++) { cnt+=2; c[i] =0; } cnt++; for(j=0;j<=n;j++) { cnt+=2; c[a[j]] = c[a[j]] +1; } cnt++; for(i=1;i<=max;i++) { cnt+=2; c[i]=c[i] + c[i - 1]; } cnt++; for(j=0;j<n;j++) { cnt+=3; b[c[a[j]]-1] = a[j]; c[a[j]]=c[a[j]] - 1; } } int *create_random_data(int n) { int *p,i; p=(int *)malloc(n*sizeof(int)); if(p==NULL) { return NULL; } else { for(i=0; i < n; i++) { p[i]=rand()%n;   } } return p; } int main() { clrscr(); int *a,*b,*c,i,n; printf("Enter value for n:"); scanf("%d",&n); a=c
Read more