From a1260e69405b48fb2244d2d0250706bffd92156f Mon Sep 17 00:00:00 2001 From: Cloud User Date: Tue, 11 Jul 2023 05:48:43 +0000 Subject: [PATCH] c-project files manoj --- Makefile | 22 ++++++++++++++++++++++ add2.c | 18 ++++++++++++++++++ big2.c | 22 ++++++++++++++++++++++ big3.c | 27 +++++++++++++++++++++++++++ fact.c | 19 +++++++++++++++++++ fibonacci.c | 21 +++++++++++++++++++++ main.c | 14 ++++++++++++++ palindrome.c | 19 +++++++++++++++++++ rev.c | 24 ++++++++++++++++++++++++ sortnum.c | 36 ++++++++++++++++++++++++++++++++++++ 10 files changed, 222 insertions(+) create mode 100755 Makefile create mode 100755 add2.c create mode 100755 big2.c create mode 100755 big3.c create mode 100755 fact.c create mode 100755 fibonacci.c create mode 100755 main.c create mode 100755 palindrome.c create mode 100755 rev.c create mode 100755 sortnum.c diff --git a/Makefile b/Makefile new file mode 100755 index 0000000..e736336 --- /dev/null +++ b/Makefile @@ -0,0 +1,22 @@ +ABC.exe:main.o big2.0 fact.o palindrome.o rev.o add2.o fibonacci.o sortnum.o big3.o + gcc -o ABC.exe main.o big2.o fact.o palindrome.o rev.o add2.o fibonacci.o sortnum.o big3.o +main.o:main.c + gcc -c main.c +big2.0:big2.c + gcc -c big2.c +fact.o:fact.c + gcc -c fact.c +palindrome.o:palindrome.c + gcc -c palindrome.c +rev.o:rev.c + gcc -c rev.c +add2.o:add2.c + gcc -c add2.c +fibonacci.o:fibonacci.c + gcc -c fibonacci.c +sortnum.o:sortnum.c + gcc -c sortnum.c +big3.o:big3.c + gcc -c big3.c +clean: + rm -rf *.o ABC.exe diff --git a/add2.c b/add2.c new file mode 100755 index 0000000..2301136 --- /dev/null +++ b/add2.c @@ -0,0 +1,18 @@ +#include + +void add2numbers() { + int num1, num2, sum; + + printf("Enter the first number: "); + scanf("%d", &num1); + + printf("Enter the second number: "); + scanf("%d", &num2); + + sum = num1 + num2; + + printf("The sum of %d and %d is %d\n", num1, num2, sum); + + // return 0; +} + 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 +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..5ee0cf8 --- /dev/null +++ b/big3.c @@ -0,0 +1,27 @@ +#include + +void biggest3() { + int num1, num2, num3; + + printf("Enter the first number: "); + scanf("%d", &num1); + + printf("Enter the second number: "); + scanf("%d", &num2); + + printf("Enter the third number: "); + scanf("%d", &num3); + + if (num1 >= num2 && num1 >= num3) { + printf("%d is the biggest number\n", num1); + } + else if (num2 >= num1 && num2 >= num3) { + printf("%d is the biggest number\n", num2); + } + else { + printf("%d is the biggest number\n", num3); + } + + //return 0; +} + diff --git a/fact.c b/fact.c new file mode 100755 index 0000000..5463ed7 --- /dev/null +++ b/fact.c @@ -0,0 +1,19 @@ +#include +void factorial() { + int n, i; + unsigned long long fact = 1; + printf("Enter 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/fibonacci.c b/fibonacci.c new file mode 100755 index 0000000..17e5d90 --- /dev/null +++ b/fibonacci.c @@ -0,0 +1,21 @@ +#include + +void fibonacci() { + int n, i; + unsigned long long fib1 = 0, fib2 = 1, fib; + + printf("Enter the number of terms: "); + scanf("%d", &n); + + printf("Fibonacci Sequence: "); + + for (i = 1; i <= n; ++i) { + printf("%llu, ", fib1); + fib = fib1 + fib2; + fib1 = fib2; + fib2 = fib; + } + + //return 0; +} + diff --git a/main.c b/main.c new file mode 100755 index 0000000..94a16f2 --- /dev/null +++ b/main.c @@ -0,0 +1,14 @@ +#include +#include + +main() { + biggest(); + factorial(); + palindrome(); + reverse(); + fibonacci(); + add2numbers(); + sortnum(); + biggest3(); +} + diff --git a/palindrome.c b/palindrome.c new file mode 100755 index 0000000..8de39b5 --- /dev/null +++ b/palindrome.c @@ -0,0 +1,19 @@ +#include +#include +void palindrome() +{ + char a[5]; + int i,n,t=0; + printf("enter the string \n"); + scanf("%s",a); + for(i=0;i +void reverse() +{ + char str[1000], rev[1000]; + int i, j, count = 0; +printf("\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", rev); +} diff --git a/sortnum.c b/sortnum.c new file mode 100755 index 0000000..97d1645 --- /dev/null +++ b/sortnum.c @@ -0,0 +1,36 @@ +#include + +void sortnum() { + int num1, num2, num3, temp; + + printf("Enter the first number: "); + scanf("%d", &num1); + + printf("Enter the second number: "); + scanf("%d", &num2); + + printf("Enter the third number: "); + scanf("%d", &num3); + + // Sort the numbers in ascending order + if (num1 > num2) { + temp = num1; + num1 = num2; + num2 = temp; + } + if (num2 > num3) { + temp = num2; + num2 = num3; + num3 = temp; + } + if (num1 > num2) { + temp = num1; + num1 = num2; + num2 = temp; + } + + printf("The numbers in ascending order: %d, %d, %d\n", num1, num2, num3); + + //return 0; +} +