p and d

myselfshravan · myselfshravan · commit aed1a6e00b67 · 2023-08-14T07:39:51.000+05:30
diff --git a/11.dijkstras.c b/11.dijkstras.c
@@ -1,6 +1,8 @@
 #include <stdio.h>
+#include <stdlib.h>
 #define INFINITY 9999
 #define MAX 10
+
 void dijkstra(int G[MAX][MAX], int n, int startnode);
 
 int main()
diff --git a/3.Bubble_Insertion.c b/3.Bubble_Insertion.c
@@ -23,7 +23,7 @@ void insertionSort(int *array, int size)
     for (int i = 1; i < size; i++)
     {
         key = array[i]; // take value
-        j = i;
+        j = i;          // take index
         while (j > 0 && array[j - 1] > key)
         {
             array[j] = array[j - 1];
diff --git a/9.prims.c b/9.prims.c
@@ -1,23 +1,21 @@
 #include <stdio.h>
 #include <stdlib.h>
-
 #define infinity 9999
 #define MAX 20
 
-int G[MAX][MAX], spanning[MAX][MAX], n;
-
-int prims();
+int prims(int G[MAX][MAX], int spanning[MAX][MAX], int n);
 
 int main()
 {
+    int G[MAX][MAX], spanning[MAX][MAX], n;
     int i, j, total_cost;
     printf("Enter no. of vertices: ");
     scanf("%d", &n);
     printf("\nEnter the adjacency matrix: \n");
     for (i = 0; i < n; i++)
         for (j = 0; j < n; j++)
             scanf("%d", &G[i][j]);
-    total_cost = prims();
+    total_cost = prims(G, spanning, n);
     printf("\nspanning tree matrix:\n");
     for (i = 0; i < n; i++)
     {
@@ -29,7 +27,7 @@ int main()
     return 0;
 }
 
-int prims()
+int prims(int G[MAX][MAX], int spanning[MAX][MAX], int n)
 {
     int cost[MAX][MAX];
     int u, v, min_distance, distance[MAX], from[MAX];

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ void insertionSort(int *array, int size)`
`23`	`23`	`for (int i = 1; i < size; i++)`
`24`	`24`	`{`
`25`	`25`	`key = array[i]; // take value`
`26`		`- j = i;`
	`26`	`+ j = i; // take index`
`27`	`27`	`while (j > 0 && array[j - 1] > key)`
`28`	`28`	`{`
`29`	`29`	`array[j] = array[j - 1];`