update for standardization

Author: jainaman224

AKS_Primarility_Test/AKS.c

@@ -1,27 +1,29 @@
-#include<stdio.h>
-int isprm(long long int n)
+#include <stdio.h>
+
+int isprm(long long n)
+{
+	long long i = 5, w = 2;
+	if (n == 2 || n==3)
+		return 1;
+	if(n%2 == 0 || n%3 == 0 || n == 1)
+		return 0;
+	while(i*i <= n)
 	{
-		long long int i=5,w=2;
-		if(n==2||n==3)
-			return 1;
-		if(n%2==0||n%3==0||n==1)
+		if(n%i == 0)
 			return 0;
-		while(i*i<=n)
-			{
-				if(n%i==0)
-					return 0;
-				i+=w;
-				w=6-w;
-			}
-		return 1;
+		i += w;
+		w = 6 - w;
 	}
+	return 1;
+}
+
 int main()
+{
+	int i;
+	for (i = 1; i <= 100000000; i++)
 	{
-		int i;
-		for(i=1;i<=100000000;i++)
-				{
-					if(isprm(i)==1)
-						printf("%d\n",i);
-				}
-		return 0;
+		if(isprm(i) == 1)
+			printf("%d\n",i);
+	}
+	return 0;
 }

Activity_Selection/Activity_Selection.c

@@ -2,7 +2,7 @@
 
 void print_activities(int start[], int finish[], int n)
 {
-    printf("%s", "Following activities are selected");
+    printf("Following activities are selected");
     int i = 0;
     printf("\n%d  ", i);
     int j;

Activity_Selection/Activity_Selection.go

@@ -10,7 +10,8 @@ func activitySelection(startTime []int, finishTime []int) {
 	// second step is to print first activity from sorted activity
 	fmt.Println("activity 1")
 	// do following in sorted activities:
-	// If the start time of this activity is greater than the finish time of previously selected activity then select this activity and print it
+	// If the start time of this activity is greater than the finish time of previously
+	// selected activity then select this activity and print it
 	preSelected := 0
 	for i := 1; i < len(finishTime); i++ {
 		if startTime[i] > finishTime[preSelected] {
@@ -19,8 +20,10 @@ func activitySelection(startTime []int, finishTime []int) {
 		}
 	}
 }
+
 func main() {
-	// first step is to sort activities by finish time, in order to save time, we use an sorted finishTime  array
+	// first step is to sort activities by finish time, in order to save time,
+	// we use an sorted finishTime  array
 	startTime := []int{1, 3, 1, 5, 8, 6}
 	finishTime := []int{2, 6, 6, 7, 10, 8}
 	activitySelection(startTime, finishTime)

Activity_Selection/Activity_Selection.java

@@ -4,19 +4,20 @@
 
 class activity_selection
 {
-	static void activities(int start[], int finish[], int n)
+	public static void activities(int start[], int finish[], int n)
 	{
 		int i = 0, j;
 		System.out.print((i + 1) + " ");
-		for(j = 1; j < n; j++)
+		for (j = 1; j < n; j++)
 		{
-			if(start[j] >= finish[i])
+			if (start[j] >= finish[i])
 			{
 				System.out.print((j + 1) + " ");
 				i = j;
 			}
 		}
 	}
+
 	public static void main(String args[])
 	{
 		int start[] = {1, 3, 1, 5, 8, 6};

Bellmanford_Algorithm/Bellmanford.cpp

@@ -22,13 +22,10 @@ void bellmanford(int adjacency_matrix[vertices][vertices], int source)
         {
             for (int k = 0; k < vertices; k++)
             {
-                if (adjacency_matrix[j][k] != 0)
+                if (adjacency_matrix[j][k] != 0 && distance[j] + adjacency_matrix[j][k] < distance[k])
                 {
-                    if (distance[j] + adjacency_matrix[j][k] < distance[k])
-                    {
-                        distance[k] = distance[j] + adjacency_matrix[j][k];
-                        predecessor[k] = j;
-                    }
+                    distance[k] = distance[j] + adjacency_matrix[j][k];
+                    predecessor[k] = j;
                 }
             }
         }
@@ -50,9 +47,7 @@ void bellmanford(int adjacency_matrix[vertices][vertices], int source)
     cout << "Vertex\tDistance\tpredecessor\n";
 
     for (int i = 0; i < vertices; i++)
-    {
         cout << i << "\t" << distance[i] << "\t\t" << predecessor[i] << endl;
-    }
 }
 
 int main()