diff --git a/ABC.exe b/ABC.exe
new file mode 100755
index 0000000..27fc0e5
Binary files /dev/null and b/ABC.exe differ
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..ac96475
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,22 @@
+ABC.exe: main.o big2.o fact.o rev.o pal.o big3.o sum2.o fibonaci.o sortnum.o
+	gcc -o ABC.exe main.o big2.o fact.o rev.o pal.o big3.o sum2.o fibonaci.o sortnum.o
+main.o:main.c
+	gcc -c main.c
+big2.o:big2.c
+	gcc -c big2.c
+fact.o:fact.c
+	gcc -c fact.c
+rev.o:rev.c
+	gcc -c rev.c
+pal.o:pal.c
+	gcc -c pal.c
+big3.o:big3.c
+	gcc -c big3.c
+sum2.o:sum2.c
+	gcc -c sum2.c
+fibonaci.o:fibonaci.c
+	gcc -c fibonaci.c
+sortnum.o:sortnum.c
+	gcc -c sortnum.c
+clean:
+	rm -rf *.o
diff --git a/big2.c b/big2.c
new file mode 100755
index 0000000..15ab27f
--- /dev/null
+++ b/big2.c
@@ -0,0 +1,22 @@
+#include <stdio.h>
+void biggest()
+{
+    int num1, num2;
+    // Ask user to enter the two numbers
+    printf("Please Enter Two different values\n");
+    // Read two numbers from the user
+    scanf("%d %d", &num1, &num2);
+    if(num1 > num2)
+    {
+        printf("%d is Largest\n", num1);
+    }
+    else if (num2 > num1)
+    {
+        printf("%d is Largest\n", num2);
+    }
+    else
+    {
+        printf("Both are Equal\n");
+    }
+   // return 0;
+}
diff --git a/big3.c b/big3.c
new file mode 100755
index 0000000..9d8c97f
--- /dev/null
+++ b/big3.c
@@ -0,0 +1,24 @@
+#include <stdio.h>
+
+void biggest3()
+{
+
+  double n1, n2, n3;
+
+  printf("\n\nEnter three different numbers: ");
+  scanf("%lf %lf %lf", &n1, &n2, &n3);
+
+  // if n1 is greater than both n2 and n3, n1 is the largest
+  if (n1 >= n2 && n1 >= n3)
+    printf("%.2f is the largest number.", n1);
+
+  // if n2 is greater than both n1 and n3, n2 is the largest
+  if (n2 >= n1 && n2 >= n3)
+    printf("%.2f is the largest number.", n2);
+
+  // if n3 is greater than both n1 and n2, n3 is the largest
+  if (n3 >= n1 && n3 >= n2)
+    printf("%.2f is the largest number.", n3);
+
+ //return 0;
+}
diff --git a/fact.c b/fact.c
new file mode 100755
index 0000000..ec7bd05
--- /dev/null
+++ b/fact.c
@@ -0,0 +1,19 @@
+#include <stdio.h>
+void factorial() {
+    int n, i;
+    unsigned long long fact = 1;
+    printf("\nEnter an integer:");
+    scanf("%d", &n);
+
+    // shows error if the user enters a negative integer
+    if (n < 0)
+        printf("Error! Factorial of a negative number doesn't exist.");
+    else {
+        for (i = 1; i <= n; ++i) {
+            fact *= i;
+        }
+        printf("Factorial of %d = %llu", n, fact);
+    }
+
+   // return 0;
+}
diff --git a/fibonaci.c b/fibonaci.c
new file mode 100755
index 0000000..4fe56c0
--- /dev/null
+++ b/fibonaci.c
@@ -0,0 +1,28 @@
+#include <stdio.h>
+void fibonacci() {
+
+  int i, n;
+
+  // initialize first and second terms
+  int t1 = 0, t2 = 1;
+
+  // initialize the next term (3rd term)
+  int nextTerm = t1 + t2;
+
+  // get no. of terms from user
+  printf("\n\nEnter the number of terms: ");
+  scanf("%d", &n);
+
+  // print the first two terms t1 and t2
+  printf("Fibonacci Series: %d, %d, ", t1, t2);
+
+  // print 3rd to nth terms
+  for (i = 3; i <= n; ++i) {
+    printf("%d, ", nextTerm);
+    t1 = t2;
+    t2 = nextTerm;
+    nextTerm = t1 + t2;
+  }
+
+ // return 0;
+}
diff --git a/main.c b/main.c
new file mode 100755
index 0000000..e8419f1
--- /dev/null
+++ b/main.c
@@ -0,0 +1,12 @@
+#include <stdio.h>
+main()
+{
+biggest();
+factorial();
+reverse();
+palindrome();
+biggest3();
+sumof2();
+fibonacci();
+sortingnum();
+}
diff --git a/makefile-cproject b/makefile-cproject
new file mode 160000
index 0000000..70d44db
--- /dev/null
+++ b/makefile-cproject
@@ -0,0 +1 @@
+Subproject commit 70d44dba9eeb97a51e8e79feb1a5678ab73fd34f
diff --git a/pal.c b/pal.c
new file mode 100755
index 0000000..e41b6cb
--- /dev/null
+++ b/pal.c
@@ -0,0 +1,19 @@
+#include<stdio.h>  
+void palindrome()    
+{    
+int n,r,sum=0,temp;    
+printf("\n\nEnter the number=");    
+scanf("%d",&n);    
+temp=n;    
+while(n>0)    
+{    
+r=n%10;    
+sum=(sum*10)+r;    
+n=n/10;    
+}    
+if(temp==sum)    
+printf("palindrome number ");    
+else    
+printf("not palindrome");   
+//return 0;  
+}
diff --git a/rev.c b/rev.c
new file mode 100755
index 0000000..8ac49a6
--- /dev/null
+++ b/rev.c
@@ -0,0 +1,24 @@
+#include <stdio.h>
+void reverse()
+{
+  char str[1000], rev[1000];
+  int i, j, count = 0;
+printf("\n\nEnter string to reverse:");
+  scanf("%s", str);
+  printf("\nString Before Reverse: %s", str);
+  //finding the length of the string
+  while (str[count] != '\0')
+  {
+    count++;
+  }
+  j = count - 1;
+
+  //reversing the string by swapping
+  for (i = 0; i < count; i++)
+  {
+    rev[i] = str[j];
+    j--;
+  }
+
+  printf("\nString After Reverse: %s\n", rev);
+}
diff --git a/sortnum.c b/sortnum.c
new file mode 100755
index 0000000..d47532d
--- /dev/null
+++ b/sortnum.c
@@ -0,0 +1,36 @@
+#include <stdio.h>
+void sortingnum()
+    {
+ 
+        int i, j, a, n, number[30];
+        printf("\n\nEnter the value of N: \n");
+        scanf("%d", &n);
+ 
+        printf("Enter the numbers: \n");
+        for (i = 0; i < n; ++i)
+            scanf("%d", &number[i]);
+ 
+        for (i = 0; i < n; ++i) 
+        {
+ 
+            for (j = i + 1; j < n; ++j)
+            {
+ 
+                if (number[i] > number[j]) 
+                {
+ 
+                    a =  number[i];
+                    number[i] = number[j];
+                    number[j] = a;
+ 
+                }
+ 
+            }
+ 
+        }
+ 
+        printf("The numbers arranged in ascending order are given below \n");
+        for (i = 0; i < n; ++i)
+            printf("%d\n", number[i]);
+ 
+    }
diff --git a/sum2.c b/sum2.c
new file mode 100755
index 0000000..64b9af1
--- /dev/null
+++ b/sum2.c
@@ -0,0 +1,14 @@
+#include <stdio.h>
+void sumof2() {    
+
+    int number1, number2, sum;
+    
+    printf("\n\nEnter two integers: ");
+    scanf("%d %d", &number1, &number2);
+
+    // calculate the sum
+    sum = number1 + number2;      
+    
+    printf("%d + %d = %d", number1, number2, sum);
+  //  return 0;
+}