From 6726cc43c508094b19b215f1e9c0baa0f02c08c7 Mon Sep 17 00:00:00 2001
From: Vishnupriya <79250124+vishnuyokzz@users.noreply.github.com>
Date: Sun, 14 Nov 2021 22:47:11 +0530
Subject: [PATCH 1/2] Create prime no finder

---
 prime no finder | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 prime no finder

diff --git a/prime no finder b/prime no finder
new file mode 100644
index 00000000..ed9d702e
--- /dev/null
+++ b/prime no finder	
@@ -0,0 +1,19 @@
+#include<stdio.h>  
+int main(){    
+int n,i,m=0,flag=0;    
+printf("Enter the number to check prime:");    
+scanf("%d",&n);    
+m=n/2;    
+for(i=2;i<=m;i++)    
+{    
+if(n%i==0)    
+{    
+printf("Number is not prime");    
+flag=1;    
+break;    
+}    
+}    
+if(flag==0)    
+printf("Number is prime");     
+return 0;  
+ }    

From 12ea364d01d6117be13d4174d936169bd3deb19d Mon Sep 17 00:00:00 2001
From: Vishnupriya <79250124+vishnuyokzz@users.noreply.github.com>
Date: Sun, 14 Nov 2021 23:05:37 +0530
Subject: [PATCH 2/2] Create Dijkstra's Algorithm

---
 Dijkstra's Algorithm | 82 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 82 insertions(+)
 create mode 100644 Dijkstra's Algorithm

diff --git a/Dijkstra's Algorithm b/Dijkstra's Algorithm
new file mode 100644
index 00000000..81298d36
--- /dev/null
+++ b/Dijkstra's Algorithm	
@@ -0,0 +1,82 @@
+#include<stdio.h>
+#include<conio.h>
+#define INFINITY 9999
+#define MAX 10
+ 
+void dijkstra(int G[MAX][MAX],int n,int startnode);
+ 
+int main()
+{
+int G[MAX][MAX],i,j,n,u;
+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]);
+printf("\nEnter the starting node:");
+scanf("%d",&u);
+dijkstra(G,n,u);
+return 0;
+}
+ 
+void dijkstra(int G[MAX][MAX],int n,int startnode)
+{
+ 
+int cost[MAX][MAX],distance[MAX],pred[MAX];
+int visited[MAX],count,mindistance,nextnode,i,j;
+//pred[] stores the predecessor of each node
+//count gives the number of nodes seen so far
+//create the cost matrix
+for(i=0;i<n;i++)
+for(j=0;j<n;j++)
+if(G[i][j]==0)
+cost[i][j]=INFINITY;
+else
+cost[i][j]=G[i][j];
+//initialize pred[],distance[] and visited[]
+for(i=0;i<n;i++)
+{
+distance[i]=cost[startnode][i];
+pred[i]=startnode;
+visited[i]=0;
+}
+distance[startnode]=0;
+visited[startnode]=1;
+count=1;
+while(count<n-1)
+{
+mindistance=INFINITY;
+//nextnode gives the node at minimum distance
+for(i=0;i<n;i++)
+if(distance[i]<mindistance&&!visited[i])
+{
+mindistance=distance[i];
+nextnode=i;
+}
+//check if a better path exists through nextnode
+visited[nextnode]=1;
+for(i=0;i<n;i++)
+if(!visited[i])
+if(mindistance+cost[nextnode][i]<distance[i])
+{
+distance[i]=mindistance+cost[nextnode][i];
+pred[i]=nextnode;
+}
+count++;
+}
+ 
+//print the path and distance of each node
+for(i=0;i<n;i++)
+if(i!=startnode)
+{
+printf("\nDistance of node%d=%d",i,distance[i]);
+printf("\nPath=%d",i);
+j=i;
+do
+{
+j=pred[j];
+printf("<-%d",j);
+}while(j!=startnode);
+}
+}