Hacktoberfest

C/program-18/program.c

@@ -13,8 +13,8 @@ int main()
     c=c+(a*a*a);  
     }  
     if(temp==c)  
-    printf("armstrong number");   
+    printf("armstrong number\n");
     else  
-    println("Not armstrong number");
+    printf("Not armstrong number\n");
     return 0;
 }

C/program-31/program.c

@@ -14,9 +14,9 @@ int main()
     {
         printf("Enter the details of student - %d\n",i);
         printf("Enter the name of the student\n");
-       scanf("%s",&stud[i].n);
+        scanf("%s",stud[i].n);
         printf("Enter USN\n");
-        scanf("%s",&stud[i].u);
+        scanf("%s",stud[i].u);
         printf("Enter total marks\n");
         scanf("%d",&stud[i].m);
     }
@@ -27,9 +27,9 @@ int main()
     }
     printf("Enter the details of new student\n");
     printf("Enter the name\n");   //preferred to enter equal length of name
-    scanf("%s",&stud2.n);
+    scanf("%s",stud2.n);
     printf("Enter the USN\n");
-    scanf("%s",&stud2.u);
+    scanf("%s",stud2.u);
     printf("Enter the marks\n");
     scanf("%d",&stud2.m);
     printf("enter position\n");

C/program-32/program.c

@@ -7,16 +7,16 @@ int m;
 }stud[10],stud2;
 int main()
 {
-    int n,i,p=0;
+    int n,i=0;
     printf("Enter the number of student\n");
     scanf("%d",&n);
     for(i=1;i<=n;i++)
     {
         printf("Enter the details of student - %d\n",i);
         printf("Enter the name of the student\n");
-       scanf("%s",&stud[i].n);
+       scanf("%s",stud[i].n);
         printf("Enter USN\n");
-        scanf("%s",&stud[i].u);
+        scanf("%s",stud[i].u);
         printf("Enter total marks\n");
         scanf("%d",&stud[i].m);
     }

C/program-33/program.c

@@ -1,6 +1,7 @@
 /* Arithematic operation using pointers */
 #include <stdio.h>
-void main()
+#include <stdlib.h>
+int main()
 {
 int a,b;
 int *x,*y;
@@ -9,6 +10,6 @@ x=&a;
 y=&b;
 //s=;
 printf("%d\t%d",*x+*y,abs(*x-*y));
-
+return 0;
 }
 

C/program-37/program.c

@@ -11,15 +11,13 @@ int f;
 
     if(n==0 || n==1)
     {
-
-         return ;
+        return 1;
     }
     else
     {
         f=fib(n-2)+fib(n-1);
     }
-
-
+    return f;
 }
 
 int main()

C/program-38/program.c

@@ -11,15 +11,13 @@ int f;
 
     if( n==1)
     {
-
-         return ;
+        return 1;
     }
     else
     {
         f=n*fact(n-1);
     }
-
-
+    return f;
 }
 
 int main()

C/program-39/program.c

@@ -7,7 +7,6 @@ Program to find the GCD of a number using recursion
 
 int gcd(int a,int b)
 {
-int f;
 
     if( b!=0)
     {
@@ -16,7 +15,7 @@ int f;
     }
     else
     {
-       return;
+       return a;
     }
 
 

C/program-40/program.c

@@ -8,7 +8,8 @@ int ack(int m,int n)
     else if(m!=0 && n==0)
       return ack(m-1,1);
     else if (m!=0 && n!=0)
-      return ack(m-1,ack(m,n-1));  
+      return ack(m-1,ack(m,n-1));
+    return 0;
 }
 
 int main()

C/program-42/program42.c → C/program-42/program.c

@@ -1,7 +1,7 @@
 /*C Program to print Floyd’s triangle*/
 // Without using a temporary variable and with only one loop 
 #include<stdio.h> 
-void floyd(n){ 
+void floyd(int n){
     int i,j=1; 
     for (i=1;i<=(n*(n+1))/2;i++){ 
         printf("%d ",i); 

C/program-44/program.c

@@ -5,7 +5,7 @@
 // Alphabet Z Pattern 
 void alphabet_Z_Pattern(int N) 
 { 
-	int index, side_index, size; 
+	int index, side_index;
 
 	// Declaring the values of Right, 
 	// Left and Diagonal values 

Java/program-1/README.md

@@ -0,0 +1,9 @@
+Program 1
+
+Write a program to find the maximum and minimum element in an array.
+
+Variable description--
+N=Number of elements in an array
+arr=Array of size N
+min= Holds the minimum element
+max=Holds the maximum element

Java/program-1/program.java

@@ -0,0 +1,24 @@
+import java.util.*;
+import java.io.*;
+
+class prg {
+	public static void main (String[] args) {
+		Scanner sc=new Scanner(System.in);
+		System.out.println("Enter the size of array");
+		int N=sc.nextInt();
+		int arr[]=new int[N];
+		System.out.println("Enter the elements in the array");
+		for(int i=0;i<N;i++)
+		arr[i]=sc.nextInt();
+		int min=arr[0]; // Assuming first element to be the minimum
+		int max=arr[0]; // Assuming first element to be the maximum
+		for(int i=1;i<N;i++)
+		{
+		    if(arr[i]<min)
+		    min=arr[i];
+		    if(arr[i]>max)
+		    max=arr[i];
+		}
+		System.out.println("Minimum="+min+"\nMaximum="+max);
+	}
+}