From 54e2968835d150a02557983bf7874120b392e96d Mon Sep 17 00:00:00 2001 From: Cloud User Date: Tue, 11 Jul 2023 06:57:15 +0000 Subject: [PATCH 1/2] added makefile project --- makefile-cproject | 1 + 1 file changed, 1 insertion(+) create mode 160000 makefile-cproject 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 From e717f0bf3b10f7134640f38ec2ccf10e40d55677 Mon Sep 17 00:00:00 2001 From: Cloud User Date: Tue, 11 Jul 2023 07:06:28 +0000 Subject: [PATCH 2/2] added all makefiles --- ABC.exe | Bin 0 -> 26424 bytes Makefile | 22 ++++++++++++++++++++++ big2.c | 22 ++++++++++++++++++++++ big3.c | 24 ++++++++++++++++++++++++ fact.c | 19 +++++++++++++++++++ fibonaci.c | 28 ++++++++++++++++++++++++++++ main.c | 12 ++++++++++++ pal.c | 19 +++++++++++++++++++ rev.c | 24 ++++++++++++++++++++++++ sortnum.c | 36 ++++++++++++++++++++++++++++++++++++ sum2.c | 14 ++++++++++++++ 11 files changed, 220 insertions(+) create mode 100755 ABC.exe create mode 100644 Makefile create mode 100755 big2.c create mode 100755 big3.c create mode 100755 fact.c create mode 100755 fibonaci.c create mode 100755 main.c create mode 100755 pal.c create mode 100755 rev.c create mode 100755 sortnum.c create mode 100755 sum2.c diff --git a/ABC.exe b/ABC.exe new file mode 100755 index 0000000000000000000000000000000000000000..27fc0e5ec97291da05317396f6ea21e9d329a31c GIT binary patch literal 26424 zcmeHQe{fvIecwCTSQxNmgN=X$KN~w>6Q6$AII<~lvVHQoW7*V}Kr~IBPj~O6gVUY3 zdj}GAi4)^ALUG4*NMTai0yAxxPCKPTCrzfzNU|9WolYW$KVWE59BQT_GE^iA71ZJS z`R?xb-Fv5Zlx8}UX8Lw?_uc(`zu(>Oes}lXdvAZ}OR>G3;ZR6$2#Z?n<^2})bkk~yk0;#B2XuL&Mmq@hzosFb zZF4r$w{=T%Hnl06$(4pT4YzOIv~^3Qn2)qc39^gIpgy&GUyleM5fg-IH_EoSLZ^xU z-K*YcdFZ28zV$mV{K=<(bnM%Q9yoH{b({y4Niq~jpG~4P@%TgOPZ~&Pg^%!EzziS! za$tV)*Vn*Hzzuw=LlXeMd>#UBR0~tuG~wx_S+o-c+Z;?}a$=}t7XfFA`Q)~3W-*z_ zrNvMole5!;M5zt7irstn?AU3xMLy@m+9EeO@y%O=xu?6!Oj!l1KU1`=LU-5BY(8go zC;GA$GVdSE=X9B-67>~SZBZv%g<6Z+qE2=t?q64CGMCZFYX^_8($$%ZsTFtV^xr-5 zN9eX;u@7kqXK#y2N`0Byh{LoCcenqn3zyd~tuXJx^`%R4nxauj3FE#g9tb=Tcp&gV;DNvcfd_uwJn*xIYd?%1JzpOmTm0i@A>zj->~MK1 ze)NU^_5{+Df9pGY zM$ddPKKf?-=(*Y3yJM{rtuMz{fmr;&bUp!)kg$5Q5}SRgx#-$8UKA67l1U zA11PG-d+h)BNT_J7njdAtUf||r!<9pLdxIt+e9{e6d#?9PriFwd~&`n9(pl;<|F$G zWbg|-4pIj7<+JIA)w?SCRQ{1$u7a*8UEUKPeQWvw)Z)d(OMryFaO%XVbj3LG2g%Po zOoHDbGp4)nrDD%Ju_(Nwu>Wvk6Y!A2zKPp(6?@x>9lc@O_4 z;x8TFO=Vn#_=%UfU?YAyHcQPr-s|MH1QM{|JXvs$gNA^P#m*m_7+F3(lj3*>z3 z>DUFzV`e4Fk3SwC>zR!={LRVuXl(WjBRL;yA_>@E*l_IhNUwd?M<9xY%bZ|bT?7whxZ0_)@uz_H*;pa|KuOnZs0NPRK zI^MX3TkgAL_VL&(sjYL+=YWpIW?{#SMea(TjAthL)9G}4a@v@j509Ri{9yHlmqufA zV_kEjFHN2ehh7RzY&bdEGly<4Iz_-#Xkzpv>Jyq8jiF~Clc{*-2P%`F7?U4{C+Am> zPL57dHnZR#oA}bBsO-(L3#H}b*E^;(!IYVX@$C+<#8V|>{C0=)&VN!}x~9=bXHlnl zs#C$?z5(t}8yaKt`0AQXH#AQcZgA4mGTju10qJ-{ZesjF(xYB8{g~F9CB6BIo=jKt zW~=o~tvBuH6~i+dsYHoL3xH6W)784yLD$u6oT4{lnkq(KZN`qZ2g# zX6}&MV~-wFIbjfvJtX6}f^Ahim8L;JW7HAFHD=VU)-$J*N8wy_^lh>E!%w?P9~*Cn zVbiN!HNdDxF1kQiey?Ns#a_!_C1=Us0r@-X{BnvQ1Re-H5O^T)K;VJE1AzzrPkJEa znQau}_N#0z6hI$BOCSgH#t+L#^eH|)GouArh!w1{2-%-$mMOL0(0ZCP4+;+vRuwn z6)SEx#QJO+=F5**A8AXIAE~sg@}+h`q+$sgLHkguv-@vEGms}z6-mct@+zt}s1!tJ zrZ1mMB$FBApjF6NK-Z@}D?frFWP8PKOEolQv5(A63DuMpk5I1NPFY2?dm)kQx6mVU zMxvOsaw%$#d;znsvQPA*WphTKmCfHz`7NdLLf6#YO#S3ie4cryTz(dG8uV+RP4AY= zPk??8^fk~8|6VT7gFX$~gr}sI*>brZ^gYmC&==k-mxn>0`DwZQIB4i+;3<>O7(nwefJ~l9(b6rO)d}hy=%TZ9V ztg&-h({DCha)131aog25Z`{0YEy0u*)$3j8ex87iWsP4A@4W1y@Es^o@xKmu1L`*7 z;oA=XuYi9A{6FyUM;-n@0iOkb(!+n=;hzWo2z>R5hyOi?e<|v{3%)z&;lJVVKMQ_6 zd`fEtD)x6f{Jr3Jfd7<-|AfQOf`1bHO`wi`-3=irKsrGPJP>#w@Ic^!zypB?0uKZp z_?3Aeib+@sjhfOe8wFl2d#Or7ASz>6>?lM0%BZAQsiY9Ms`NEF&FhP==CtP1{V@gR z|NNtJp3+a&MTw|2+Mq`kMJXxQLKB_PeEINz^q&%laET(KNz;{@GNEY@8KO~1!YU== zn(}i2uc5qB<5P>HGRF9jPP5&Iv>XCwXM~-;Q$^3;|W_cHf`Ae zd1@nirV?<%?v8b#%|orNEjJ1ARh=hOgJdWuxy6N2E=Nz2{mEo?LBf!N71=~Cm+!;# zr=P6TM|HkK*-}45bBRG~yP*{+JMK%W{EfT!-zn~1jHfzhU98mK7^XheKnfHjb|aQA zC+{(n*+g+bh|3j6^EM{a=1?JTTS+^U&r!$cF{I1s+<%~ZPv>2tOlqq|pzouD=Tqqn_Q(IPcMd0l_ei)V zZv3@;k3{dn=-nV4K~h}@Zr5+<_NDh(6JDR`e8%n|TC zQ!qymynEDr;gi36q)y|R%S*I6XNB=Ro}Uc=hBNh(;W_42`uE;XhUcAc*YnSQGEZv# zPCcjXC$n4YGyP>{*w$-4#%8v)N0$i~er%}24^~rMbb(AA)@rx=;&r0e7hfa}`{Ik8 z`F3|9b(mS4@ReWU%*T7>>xJJub{%FFdH&lgzf|x%x);AhO!>@**U{==?N_h-Wy0{q zmpOgWE8ifv-*|EKWFzW^WV}u+7sG4)@D*a(7srgRUf&=y&|h^}bzJX@uM~ds?sb^` z<@2Gu`CwIoUccbQn?#E*ewEnbi}Pv>cP?~J)HS00P}Bp4kXj_(lXKE;#;ueHFLUPZ znRlQDez(RCRkhbwYT$BR2lB6$|A!j#Kdgb%dU3L|I-e%0m=E4s1K$Tc1W)idGALh! zUM7@Aew_oi*@bjaS$A&os`zW9)|)fcuS??*k8uW#Y-I z{(nZ}Q&spmjq`de&i_N;AyFCE)T|UPT15E5>&zzLR4%XYQqn?flky9%SG~af>^E!R z=^FT84ZK(bAE|*Kse%7~4g3#l;I-Q23CM@U3Nf@U%C2#!pCA5G$}hZbKL=d+{9e2$ zixY8UQlK8^w|EGbkU?CTcNPL;NT9+&L zmVn<5yb-JCs(&wTBl+;c-_2N!{Cjo&naiWH)K_%bNsV8x419UGQPdkzH!L0_obE_9E}H`qe*v8QJhD>BKc%(uxNbCJ9JNOku3_;k$>X}g z;~hyEY@N>`Jx)KP@s~9I8&^ana!%uCfK&d}{``@a=X+AQHwZd!YWyjEuR5ah`H992 zZU0>we^25%;UY`1C~SGSX+gbK0XJN79Bl!_) zhx>TJrLfQgx`YL_b1Bu}Rn^+1;B^Po?M%`vVAo&LU0*Nmt+$uwt*4i_ut#|LKK}3u z$P5#q-GjU`RsQlaWd>fqnW?ODTEe#Igj#aqP{vZGRJu_uF&bGI zj77VIgQ}9EasaMr4`O{Pj=-g}byIn>Kb!AMWX%+|;TFwAX;>ulgF{)%wo;K6e+e^< z#x`lQ=Lqb!3nM};CQX$F2S=ddN}1FxJfd{6FYM{d^tXYevHceW+ja4cO|*)$8KhVm zlmcqUYKD+}!N%@c#7wjEKu1^1jP2WH;?&+^1jyb{>p%o828d_Qp&qj&=t_q3X!tD4!<$-<%svClfoeblx!4LvCXhrj<(A2_b!? zPb>CFx^@avg|Ms{b%G_Nr4AxS!h0&QnJVVZfkZAvCl>G74=L=cHA_V+CDOd1SJdbS zIj9v=e=x zc0thrj>(nAxWLMv1JpW#35g-AVB>=AKz*eQPTJ1kM?pdzJN9gn7fli$pf%Nz)JP6R zC~6l(ggDfiw4~adFu}t$CqW82Hk8FxnmVM2*w!$vR2aniRzhKI!k!a{T^oO6$j6 z`d1=et^X7-vWx2{_&Hctoc9swY-Cv+C;9|FZhb@R8(Kd~LaxC6Wcn@e-1>Zfe@F}b zn`4;Dg!MSfzpm2f_lt3=EP}JgLnRm3{~T~CpZ(9zFTzj?C5NHX>_3$fg5HO@_4$1z z|6heH3u;p!9X40Nf9SfAgg^8d}?|Bpe}C<Mcr*wvmpLSGb#IHV8U0liycPYKc^+rF+rUxJPJ70e<2F7()8tS{TSJACiPx# literal 0 HcmV?d00001 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 +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 + +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 +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 +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 +main() +{ +biggest(); +factorial(); +reverse(); +palindrome(); +biggest3(); +sumof2(); +fibonacci(); +sortingnum(); +} 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 +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 +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 +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 +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; +}