From a44020dd931c15f4acdae91943a017a527e6eb40 Mon Sep 17 00:00:00 2001 From: Cloud User Date: Tue, 11 Jul 2023 03:16:14 +0000 Subject: [PATCH 1/2] add .c files --- add2.c | 14 ++++++++++++++ big2.c | 22 ++++++++++++++++++++++ big3.c | 23 +++++++++++++++++++++++ fact.c | 12 ++++++++++++ fib.c | 28 ++++++++++++++++++++++++++++ main.c | 10 ++++++++++ pallin.c | 22 ++++++++++++++++++++++ rev.c | 20 ++++++++++++++++++++ sort.c | 37 +++++++++++++++++++++++++++++++++++++ 9 files changed, 188 insertions(+) create mode 100644 add2.c create mode 100644 big2.c create mode 100644 big3.c create mode 100644 fact.c create mode 100644 fib.c create mode 100644 main.c create mode 100644 pallin.c create mode 100644 rev.c create mode 100644 sort.c diff --git a/add2.c b/add2.c new file mode 100644 index 0000000..836ac00 --- /dev/null +++ b/add2.c @@ -0,0 +1,14 @@ +#include +addition2() { + + int number1, number2, sum; + + printf("Enter two integers: "); + scanf("%d %d", &number1, &number2); + + // calculate the sum + sum = number1 + number2; + + printf("%d + %d = %d", number1, number2, sum); + //return 0; +} diff --git a/big2.c b/big2.c new file mode 100644 index 0000000..56e62db --- /dev/null +++ b/big2.c @@ -0,0 +1,22 @@ +#include +void biggest2() +{ + 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 100644 index 0000000..5c5c846 --- /dev/null +++ b/big3.c @@ -0,0 +1,23 @@ +#include + +void biggest3() { + + double n1, n2, n3; + + printf("Enter 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 100644 index 0000000..8d05352 --- /dev/null +++ b/fact.c @@ -0,0 +1,12 @@ +#include +void factorial() +{ + int i,fact=1,number; + printf("Enter a number: "); + scanf("%d",&number); + for(i=1;i<=number;i++){ + fact=fact*i; + } + printf("Factorial of %d is: %d",number,fact); +//return 0; +} diff --git a/fib.c b/fib.c new file mode 100644 index 0000000..f8f9cf5 --- /dev/null +++ b/fib.c @@ -0,0 +1,28 @@ +#include +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("Enter 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 100644 index 0000000..12639f0 --- /dev/null +++ b/main.c @@ -0,0 +1,10 @@ +main() { + biggest2(); + factorial(); + reverse(); + pallindrome(); + biggest3(); + fibonacci(); + sorting(); + addition2(); +} diff --git a/pallin.c b/pallin.c new file mode 100644 index 0000000..c2e7dac --- /dev/null +++ b/pallin.c @@ -0,0 +1,22 @@ +#include +void pallindrome() { + int n, reversed = 0, remainder, original; + printf("Enter an integer: "); + scanf("%d", &n); + original = n; + + // reversed integer is stored in reversed variable + while (n != 0) { + remainder = n % 10; + reversed = reversed * 10 + remainder; + n /= 10; + } + + // palindrome if orignal and reversed are equal + if (original == reversed) + printf("%d is a palindrome.", original); + else + printf("%d is not a palindrome.", original); + + //return 0; +} diff --git a/rev.c b/rev.c new file mode 100644 index 0000000..15454f5 --- /dev/null +++ b/rev.c @@ -0,0 +1,20 @@ +#include + +void reverse() { + + int n, reverse = 0, remainder; + + printf("Enter an integer: "); + scanf("%d", &n); + + while (n != 0) { + remainder = n % 10; + reverse = reverse * 10 + remainder; + n /= 10; + } + + printf("Reversed number = %d", reverse); + + //return 0; +} + diff --git a/sort.c b/sort.c new file mode 100644 index 0000000..4a95014 --- /dev/null +++ b/sort.c @@ -0,0 +1,37 @@ +#include + +void sorting() +{ + //Initialize array + int arr[] = {5, 2, 8, 7, 1}; + int temp = 0; + + //Calculate length of array arr + int length = sizeof(arr)/sizeof(arr[0]); + + //Displaying elements of original array + printf("Elements of original array: \n"); + for (int i = 0; i < length; i++) { + printf("%d ", arr[i]); + } + + //Sort the array in ascending order + for (int i = 0; i < length; i++) { + for (int j = i+1; j < length; j++) { + if(arr[i] > arr[j]) { + temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; + } + } + } + + printf("\n"); + + //Displaying elements of array after sorting + printf("Elements of array sorted in ascending order: \n"); + for (int i = 0; i < length; i++) { + printf("%d ", arr[i]); + } + // return 0; +} From 7b42c3219d9383802c9025d96cb8e2c98b04f41e Mon Sep 17 00:00:00 2001 From: Cloud User Date: Tue, 11 Jul 2023 03:31:58 +0000 Subject: [PATCH 2/2] add makefile --- file1 | 1 + file2 | 1 + makefile | 23 +++++++++++++++++++++++ 3 files changed, 25 insertions(+) create mode 100644 file1 create mode 100644 file2 create mode 100644 makefile diff --git a/file1 b/file1 new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/file1 @@ -0,0 +1 @@ + diff --git a/file2 b/file2 new file mode 100644 index 0000000..d10995a --- /dev/null +++ b/file2 @@ -0,0 +1 @@ +rfgetgheth diff --git a/makefile b/makefile new file mode 100644 index 0000000..022cef3 --- /dev/null +++ b/makefile @@ -0,0 +1,23 @@ +ABC.exe: main.o big2.o fact.o rev.o pallin.o fib.o add2.o sort.o big3.o + gcc -o ABC.exe main.o big2.o fact.o rev.o pallin.o fib.o add2.o sort.o big3.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 +pallin.o:pallin.c + gcc -c pallin.c +fib.o:fib.c + gcc -c fib.c +add2.o:add2.c + gcc -c add2.c +sort.o:sort.c + gcc -c sort.c +big3.o:big3.c + gcc -c big3.c + +clean: + rm -rf *.o