v #include selection 1 #include #include void selectionsort(int A[],int n) { int i,j,min,temp; for(i=0;i merge 2 #include #include void merge(int a[],int low,int mid,int high) { int i=low,j=mid+1,k=low,b[100000]; while(i<=mid && j<=high) { if(a[i] quick 3 #include #include void quicksort(int a[],int low,int high); int partition(int a[],int low,int high); void swap(int *a,int *b); void quicksort(int a[],int low,int high) { if(low topo 4 void ts(int a[20][20],int n) { int t[10],vis[10],stack[10],indeg[10]; int i,j,top=0,ele,k=1; for(i=1;i<=n;i++) { t[i]=0; vis[i]=0; indeg[i]=0; } for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(a[i][j]==1) indeg[j]++; printf("Indegree Array: "); for(i=1;i<=n;i++) printf("%d ",indeg[i]); for(i=1;i<=n;i++) { if(indeg[i]==0) { stack[++top]=i; vis[i]=1; } } while(top>0) { ele=stack[top--]; t[k++]=ele; for(j=1;j<=n;j++) { if(a[ele][j]==1 && vis[j]==0) { indeg[j]--; if(indeg[j]==0) { stack[++top]=j; vis[j]=1; } } } } printf("\nTopological Ordering: "); for(i=1;i<=n;i++) printf("%d ",t[i]); } int main() { int n,a[20][20],i,j; printf("Enter the number of nodes: "); scanf("%d",&n); printf("Enter the adjacency matrix:\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&a[i][j]); ts(a,n); return 0; } #include string 5 #include int main() { char text[100],pattern[100]; int i,j,n,m,flag=0; printf("Enter the text: "); scanf("%s",text); printf("Enter the pattern: "); scanf("%s",pattern); n=strlen(text); m=strlen(pattern); for(i=0;i<=n-m;i++) { for(j=0;j kanscak 66 int w[10],p[10],n; int max(int a,int b) { return a>b?a:b; } int knap(int i,int m) { if(i==n) return w[i]>m?0:p[i]; if(w[i]>m) return knap(i+1,m); return max(knap(i+1,m),knap(i+1,m- w[i])+p[i]); } int main() { int m,i,max_profit; printf("Enter the no. of objects: "); scanf("%d",&n); printf("Enter the knapsack capacity: "); scanf("%d",&m); printf("Enter profit followed by weight:\n"); for(i=1;i<=n;i++) scanf("%d %d",&p[i],&w[i]); max_profit=knap(1,m); printf("Maximum Profit = %d\n",max_profit); return 0; } #include Floyd 7a int min(int a,int b) { if(a = %d\n",i,j,p[i][j]); } } return 0; } #include warsh 7b int max(int a,int b) { if(a>b) return a; else return b; } void warshal(int p[10][10],int n) { int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++) p[i][j]=max(p[i][j],p[i][k]&&p[k][j]); } int main() { int p[10][10]={0},n,i,j; printf("Enter the number of vertices: "); scanf("%d",&n); printf("Enter the adjacency matrix:\n"); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&p[i][j]); warshal(p,n); printf("\nTransitive Closure:\n"); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) printf("%d\t",p[i][j]); printf("\n"); } return 0; } #include prim 8 #include int visited[10]={0},cost[10][10],min,mincost=0; int i,j,ne=1,a,b,u,v; int main() { int num; printf("Prim's Algorithm\n"); printf("Enter the number of nodes: "); scanf("%d",&num); printf("Enter the adjacency matrix:\n"); for(i=1;i<=num;i++) { for(j=1;j<=num;j++) { scanf("%d",&cost[i][j]); if(cost[i][j]==0) cost[i][j]=999; } } clock_t start=clock(); visited[1]=1; while(ne Kruskal 9 #include int w[10],p[10],n; int i,j,k,a,b,u,v,ne=1; int min,mincost=0,cost[9][9],parent[9]; int find(int); int uni(int,int); int main() { printf("Implementation of Kruskal's Algorithm\n"); printf("Enter the number of vertices: "); scanf("%d",&n); printf("Enter the cost adjacency matrix:\n"); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&cost[i][j]); if(cost[i][j]==0) cost[i][j]=999; } } clock_t start=clock(); printf("Edges of Minimum Cost Spanning Tree:\n"); while(ne dijistra 10 int main() { int n,a[20][20],i,j,min,u,v,s[10],d[10],k; printf("Enter the number of vertices: "); scanf("%d",&n); printf("Enter adjacency matrix:\n"); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&a[i][j]); } } printf("Enter source vertex: "); scanf("%d",&v); for(i=1;i<=n;i++) { s[i]=0; d[i]=a[v][i]; } d[v]=0; s[v]=1; for(k=2;k<=n;k++) { min=999; for(i=1;i<=n;i++) { if(d[i]d[u]+a[u][i]) d[i]=d[u]+a[u][i]; } } } printf("\nShortest Paths:\n"); for(i=1;i<=n;i++) printf("%d --> %d = %d\n",v,i,d[i]); return 0; } #include sum o f subset 11 #define MAX 10 int s[MAX],x[MAX],d; void sumofsub(int p,int k,int r) { int i; x[k]=1; if((p+s[k])==d) { for(i=1;i<=k;i++) if(x[i]==1) printf("%d ",s[i]); printf("\n"); } else if(p+s[k]+s[k+1]<=d) sumofsub(p+s[k],k+1,r-s[k]); if((p+r-s[k]>=d) && (p+s[k+1]<=d)) { x[k]=0; sumofsub(p,k+1,r-s[k]); } } int main() { int i,n,sum=0; printf("Enter n: "); scanf("%d",&n); printf("Enter the set in increasing order:\n"); for(i=1;i<=n;i++) scanf("%d",&s[i]); printf("Enter required sum: "); scanf("%d",&d); for(i=1;i<=n;i++) sum+=s[i]; if(sumd) printf("No subset possible"); else sumofsub(0,1,sum); return 0; } #include #include int x[20], count=0; int place(int k,int i) { int j; for(j=1;j

Signaler un abus

Détails PDF

Coordonnées

newsem