From bf15f8db7783b9fb82bf6a95666d4045bdf7fc75 Mon Sep 17 00:00:00 2001 From: AvaEN Date: Wed, 6 Jul 2016 00:03:17 -0400 Subject: [PATCH] Assignment 5 --- assignment5.txt | 15 +++++++++++++++ loop | Bin 0 -> 8776 bytes loopFibonacci.c | 30 ++++++++++++++++++++++++++++++ recurse | Bin 0 -> 8808 bytes recurseFibonacci.c | 33 +++++++++++++++++++++++++++++++++ 5 files changed, 78 insertions(+) create mode 100644 assignment5.txt create mode 100755 loop create mode 100644 loopFibonacci.c create mode 100755 recurse create mode 100644 recurseFibonacci.c diff --git a/assignment5.txt b/assignment5.txt new file mode 100644 index 0000000..0c289f0 --- /dev/null +++ b/assignment5.txt @@ -0,0 +1,15 @@ +Ava N. +July 5, 2016 +Assignment 5 + +1. I would call int fxn(int a, float b, int c) by: +main(){ + int a, c; + float b; + int fxn(int a, float b, int c) + return 0; +} + +2. Recursion is when a function calls itself. Iteration is the repitition of a process or something, which can also be refered to as a loop. The best process to use, whether it is recursion or iteration depends on the circumstance. Iteration keeps going until the loop is complete while recursion solves a problem one at a time. Recursion is worse in other cases because it takes up more space and time... + +3. A compiler works by taking 'High-level language' such as C, C++, and Java, and putting it through a compiler (gcc) to make an assembly. diff --git a/loop b/loop new file mode 100755 index 0000000000000000000000000000000000000000..165a11d848d6afca74a94a44156ad7dc284382dc GIT binary patch literal 8776 zcmeHMYiv}<6`tL-jl*NTkOvN=4_c{G)haEO`lCGYd>>*LAuab0?wdoyI z0aGC~Sx$Q7YrrpA&@q`|sw+PXMOlwn(rZzAElQ8+b>$dSZXdOco?&Hg*sFshUMC{@ zdETy6Mtr+F6uahjOE;CF!Y*;X5y(7>gKR<5@D8ZwuzO~|VOSO-wV#V%Ma=fc! zcPiGJN@faEtyA4ytz8|#d^Wg8wwvse?7_n$vL=qB29A8b4-bt2D*qro|NWO+c7Nd) z2j2P7$A4%!(sBCKy`;+zvY$KAFx^r^ddC`g+Zy=3HShu88XkAr0H9XA0&$8`Sh|F1 zCiB_o{{3b?8p$NYWWmY<%UhA?2{Srz!c0VxDKVK#W~>Bo(xbwhWu_y^43OjLY(^ob zI5;@a(`)Vt?kndy%DFwkPI%)*e7*SD@%DhDcyhmQO(r){$#V+3Px3x7uK2>X;Lh=F%zV^n%+_~q z(1h{IC98fR4`E~GFO65&qD@Pk4@0E1YbXAjcIe0vKS70yH%dsmwh>RRFJ71Y7UId} z#Y>W3PdvH0_#4T4i6<8qe=7Okt=B~2Jb0PfKOQK)`GQe=*O+%z8@icTOj~>xt#%$fL7IMBA zUT(j1ExbTZUkiUk@tr@55G;ISrBpJ`h2JxZSLc5QKpI?l4e0zuDt{iiYvCo*yZPkI zx0XCFHO_{Yis4%~x6Y0%%)-=lFrdXSxLd{WNA!Pn{*AJ&{je|-Uh>R_-`gKv`sVAl z%d>};W5(W%(mM>7ItaaSC2>CVZ0MO#u@o8!4G*5%wbGy=nCDuF9vdj$9w@#w_$alk z(YXAXZ{a(i!S`1_wzT$lIR1mh4+o34`(UAT-`|ayD;{J2&BBK?5T73neKj;1dLd+9 zIbZ3oPcc5FJvCH4a)t^K&RFrBW=+JkOd&mvY&M|*N$16`7{$Vf=i*v2FD3eupZ;<3FuA10V&F#N?;*p(d=@(0d%dp9+Be~+5&GHUo3e2#;P9)I9_-X4GRtG=*b zJ6G4^Z~1P$;cq+BVEDUd)*bTeIe&M^-xl(>^!PQ%LB7Y|DBm-`hWc69ajrvT@@~2t zfx8j78-cqKs6;?(&~1jPD&oBz(~SzBtFz^?nUu-GYnal5@}JIIV=}j0@mShr;^Snq zDyR1WB`*K>N-0bH1+Pw|eC8YT**xzB=e#yg?>;k?8@u$-`C0_44fol?}{(D{GtH;j~X{TD2xG3-d z-g@qFwOh)so_8;b4X{{)=sb&vC_z_rzGinoAo_C6>K*Z6;za9HAXpib$2 z0-WL|RNUeUe+M)mwu$FlcIK5l-yidt(Sv}KygNRdfRlZ?7ojvK|A7J5RNhG*k@8N& z&g;ObU2gk>YuNdZ^s~l#8_ijHtB^1hAa(4nvyKHLXSZMQjJr5qDx-&YQY4h{4| z%26Wk83Exo)(jh_ZO!OAD$Ij}Pxpid&8PeOkA;WL;ZVlhJ%ZHba;L!-vdD zfQAqCQh0_VF$?)P0#a!U1qA$fKCjH!7q3s9G>@vT?@dMWdD-vItK5ns z`=E~2b4O5Ec+^w{MFjJw(pF>~)XLd(f^)e4jprssFq5_7!BEdYs}(t}xZ{~ZaJ-Pj zrF$|ag2YWk@)IH$JC%Vwn_4-$!zPm*Qx>*Tw{qFX^tn_=79G~-arO)jreX`}&e-#+{MgCFZ zef*r#=ku;zYWvE0qD4GTectciQ2JveW`Eg)oBxSRpWoj@ zO8;RFtTMp$vb~?X^!c1&(WF4)^RUgWZvU@PK>l+zybqaH`ZT_s$?gAdQRvj?@1^`5 zwZo~5yb5a>opzc*ii)xx(`A=F?}v4z&wjEQ)?e=tB(633U}k-_Rv~JiRNdm`UC3XE5Q>} LO51H!SxNp2rWvnG literal 0 HcmV?d00001 diff --git a/loopFibonacci.c b/loopFibonacci.c new file mode 100644 index 0000000..cb36d9f --- /dev/null +++ b/loopFibonacci.c @@ -0,0 +1,30 @@ +/*Ava N.*/ +//fibonacci sequence as a loop +#include +#include + +int main(){ + int input; + int num1=0; + int num2=1; + int answer; + int counter; + + printf("Enter the number of terms\n"); + scanf("%d", &input); + + printf("Here is the Fibonacci Sequence: \n"); + + for (counter=0; counter11YJgPZ(Pa&Br^I|wxn^Fc^nBn|csjfe(Bai(f%#SkMhgycgv6=6BI&B=@NcYe zMCL+h5+FN@HQ<*b_^>Q6*Hs*b;%rAE*)=Jkj_mBEU&w%nb;MF0KtP>O6 z^0&xIm*~)Yc8toJa-`Mi1VeWCLsAlgIoo|1b`F+lad-SO6?zQAkw zcdSsuk3ZLT`gi~M;6<|K2gT1!G)x;RXm48vZ&?Q4vkcw~T*Kq0RRAirE0CusrKMe% zW;~OM?%iuEmdn@A-U zVv7BJy`5d=&fuOxX?LNtGuVb`yvVN?e@?zVkSL%0-Z#eMYpCXNg{_yePmCxzyE%@T zG(FLZ`2tl zs@qm+!g%4FT|J+HvN8S3x;ggf@O;}{P|5Guj^FxiI!YvuQ{}a*dC-o{Bva_uE=#$A zWD5D(IVrCsnL@pGM#^52Da31UNcrb0H8J`sWJ#?b^yc1v(#ZYAnEumtGi)0sHtI@^$Phj}TX#KWsA!Z&!2M3MjLtw`AqTk59_so_Vaz))*J2Xob`KwTV zUiu%Jqh5>#Sw2hkgT}W%ln&0{^1*?TTQJVg?=w6XjJI#u8w%c5vA6ndVrb53|JWCL z5x>Z;9faY05`hg}sBQ=3`B=6zt6{-2ruT_#_4V(-R=7pVWUGf3n7o?H36aWZ_v$X%HI5P)oKJ_2-hk?J?1bTRyiZ1wIF z;RUquRci9W?4~-_UI(4&@PcO=dWd9i_>*tG>vZnK;9|_!wO%%kf%W@O^Z852g_Hl# zW1&YwxqN6aG|+c)$FFNNB>!YH@x#5jo4vVr`|hRi>x}cC`sN>lsqw-Gw$}Oww(rZm z-A4&JjUMZ+4pJSJ~0&fT4*TrWXPO*wfKHN#(0+g)X?_G8IAAA)DcS? zPd%$8QpquGDwWlqjU;W&9=Ej7_(&v~ibmsF#(FwyC8L&Rr?e640Zr_PQ4)y^D{X1< zj5O$pkED_jGB~UZr0Po2^K9`wNZ%Tod*}Y0&%X%Xf^Izyeh*T32K;I8E8qd-coF;< zxULohTIY#8NBf0mGT_;=y0-3BPi=s3`nF$&&-+M0QDuE0wxgc(TcAHoy8b|qzwzPv zRnOKP6Z2G}57xrr>t2+HnFI5}+HG zDd|moe~C89Upj9M%hDDl^ZLuj$wpOA>oF16|LayhMe-@HPONa|8}>Oe?*(VPjx0Y` z(3`|Vw8~+kQSl9mGb`*pv3(-qwVCbtJ4E|hqKys{y6P|EO-kmtxjl6ZEwqp2U-oBS z#g9*+Y-+ci!s&+Rm2N_LkkPyWF;JnNBPnUfm7LbIm|S+$ZdccvWE>l{)ibRLxY> zuMs@X%JpkSrT62*sO9%suD?R?_$bF$7RFIIzDn?XD#urgtLlA}<7wl%VTmuz=TYUSuzo`(I*!Lv;l2C_c%^U zYfHlvSAeheZW4xT{J%#yJn=eErEKXCO?jj13nEMY3h^iK0LJIzE%3hz<4Jj(&!3|s?uQ&8%=QJiyuQ-9s<(!H#eO5Gm=h6rc5hor>DedIx=CIvFyae6iiAa6Pk9J zYTAls(;2I9o|m!q^oI_F&G5l)1nWf3>W5@7IQRkpo=mz5E)5W@&;7b z`6iQYEln#Hu_JI&ek)p3+N~}~i-8 zrz|rfn37#3{F^bOr0_6SaA94QK+Gr$V5Df7*aO52STquh%}2JX3GR-K!rK_-$3;J#ndjY z`(7PV@&8YJ{*WMkNVk;khER(K%Z4Q0fAar#G=($c^^@gR6iV%RpK2?I+gVX@w|zJ8 zn>ZtI`=`9R)I6mCj=x%>#dDMr#X%J4OvLuQ@10S=X{A^LPJMTuXC4JcXC}5E_UVuW z_Q{eJ&RveQG=EQ`g3df_&->^r%3l3@t#Hm`J?2lrp3YD#^L~3?+3Tudcl-(#v_GPp zvOVw1n^dB)gOudXALGxXmQ*_(wZi^gSN4+%CwsDS=kH};lvj$6i1+z3%AU`|POZ}x zmx<@_l-l!o;Ht78CZ!VM|MM{a9_mW%b+r%GRfjoVcHx#^ciHpz{gATn=fo-p+%Eh3 zq064nA#c*80P%U*k(T!Vr>LO#xf$N4oKf}@Y^b<9{-3$*`Twb!Qhdl|uhLpTXI=Ju z{ux>Pe5_a<_j8bu`A+a4npZ`2VhMeYgBBZ0k$x`8?IACXQR*E&my|6e73J=PvCt z+W#H4G +#include + +int fibo(int K){ + if ( K == 0 ){ + return 0; + } + else if ( K == 1 ){ + return 1; + } + else{ + return (fibo(K-1) + fibo(K-2)); + } +} + +int main(){ + int K; + int answer=0; + int counter; + + printf("Type how long you want the fibanocci sequence to be: \n"); + scanf("%d",&K); + + printf("Here is the Fibonacci Sequence: \n"); + + for (counter=1 ; counter<= K ; counter++ ){ + printf("%d\n", fibo(answer)); + answer++; + } +} +