<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Echelon Tech on Medium]]></title>
        <description><![CDATA[Stories by Echelon Tech on Medium]]></description>
        <link>https://medium.com/@IngenuityDias?source=rss-5fb95d1d0590------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*WzCrKZ5Wl7wi-J2NifjOxg.png</url>
            <title>Stories by Echelon Tech on Medium</title>
            <link>https://medium.com/@IngenuityDias?source=rss-5fb95d1d0590------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 03:28:17 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@IngenuityDias/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[C Programming With Examples- Fibonacci Series Using ARRAY And FOR Loop]]></title>
            <link>https://medium.com/@IngenuityDias/c-programming-with-examples-fibonacci-series-using-array-and-for-loop-49404a82fdde?source=rss-5fb95d1d0590------2</link>
            <guid isPermaLink="false">https://medium.com/p/49404a82fdde</guid>
            <dc:creator><![CDATA[Echelon Tech]]></dc:creator>
            <pubDate>Wed, 07 Sep 2016 11:58:58 GMT</pubDate>
            <atom:updated>2016-09-07T11:58:58.026Z</atom:updated>
            <content:encoded><![CDATA[<iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2F4pBa9s4Dfoc%3Ffeature%3Doembed&amp;url=http%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D4pBa9s4Dfoc&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2F4pBa9s4Dfoc%2Fhqdefault.jpg&amp;key=d04bfffea46d4aeda930ec88cc64b87c&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/bbd5c262ad8d9ac0986d44a6b98befa0/href">https://medium.com/media/bbd5c262ad8d9ac0986d44a6b98befa0/href</a></iframe><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=49404a82fdde" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Fibonacci Series Using Array And For Loop — C Programming Examples]]></title>
            <link>https://medium.com/@IngenuityDias/fibonacci-series-using-array-and-for-loop-c-programming-examples-de8346f041ba?source=rss-5fb95d1d0590------2</link>
            <guid isPermaLink="false">https://medium.com/p/de8346f041ba</guid>
            <category><![CDATA[c]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[javascript]]></category>
            <category><![CDATA[c-program]]></category>
            <category><![CDATA[objective-c]]></category>
            <dc:creator><![CDATA[Echelon Tech]]></dc:creator>
            <pubDate>Tue, 23 Aug 2016 00:00:00 GMT</pubDate>
            <atom:updated>2016-09-07T12:07:28.895Z</atom:updated>
            <content:encoded><![CDATA[<p>Fibonacci Series Using Array And For Loop — C Programming Examples</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/0*-ufAQbGYo1_KdqNo.png" /></figure><p>As we have started C Programming coding with Example Series, We have published last posts<br> “<a href="http://www.techdias.com/2016/01/harmonic-progression-write-program-to.html">Write A Program For SUM of Infinite HP</a>”<br> <br> “<a href="http://www.techdias.com/2015/12/arithmetic-progression-write-program-to.html">Write A Program To Find SUM of AP</a>” and<br> <br> “<a href="http://www.techdias.com/2015/12/geometric-progression-write-program-to.html">Write A Program To Find SUM of GP Sequence</a>”.<br> <br> We have chosen to start with Arithmetic Series and in this post you will find some basic idea and some useful concepts about Fibonacci Numbers .You can download C Codes below.Please let us know your feedback.</p><p>In this post we are doing again Fibonacci Series but with different approach.In last post “<a href="http://www.techdias.com/2016/05/fibonacci-numbers-series-progression.html">Fibonacci Progression Using While Loop</a>” you will see how to generate Fibonacci Numbers by using concepts of Do-While Loop.In this post we will talk about another loop i.e. For Loop and side by side Concept of Arrays will be discussed and demonstrated.</p><p>Fibonacci Series — Sequence ( Using Array And For Loop ) Video Tutorial(See C- Codes Below ):</p><p>For Loop Concept: FOR Loops are the most useful type. The syntax for a for loop is</p><p>for ( variable initialisation; condition; variable update ) {<br> Code to execute while the condition is true<br> }</p><p>A working Example of FOR Loop<br> Example:<br> <br> #include &lt;stdio.h&gt;<br> <br> int main()<br> {<br> int x;<br> /* The loop goes while x &lt; 10, and x increases by one every loop*/<br> for ( x = 0; x &lt; 10; x++ )<br> {<br> /* Keep in mind that the loop condition checks <br> the conditional statement before it loops again.*/ <br> printf( “%d\n”, x );<br> }<br> getchar();<br> }<br> Array Concept: Arrays may be defined as a kind of data structure that can store a fixed-size sequential collection of elements of the same type.An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type.</p><p>Arrays are of two types:<br>A. One-dimensional arrays<br>B. Multidimensional arrays</p><p>To declare an array in C, specifies the type of the elements and the number of elements required by an array as follows −</p><p>type arrayName [ arraySize ]</p><p>Initialising array in C using a single statement −</p><p>double MoneyBalance[5] = {1000.0, 2.0, 3.4, 7.0, 50.0};</p><p>If you omit the size of the array, an array just big enough to hold the initialisation is created −</p><p>double MoneyBalance[] = {1000.0, 2.0, 3.4, 7.0, 50.0};</p><p>More of <a href="http://www.techdias.com/2016/05/fibonacci-numbers-series-progression.html">Fibonacci Sequence Tutorials</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/0*b8AASJGY8_wT7o6W.png" /></figure><p>Write A Program In C To Find Fibonacci Numbers Progression — Series — Sequence to Nth Term:C Codes are written and tested in TuboC/C++ IDE as you can see in Video:<br> <br> C Program -<br> <br> #include&lt;stdio.h&gt;<br> int main()<br> {<br> int i,range;<br> long int arr[40];<br> <br> printf(“\nEnter the number range: “);<br> scanf(“%d”,&amp;range);<br> <br> arr[0]=0;<br> arr[1]=1;<br> <br> for(i=2;i&lt;range;i++){<br> arr[i] = arr[i-1] + arr[i-2];<br> }<br> <br> printf(“Fibonacci series is: “);<br> for(i=0;i&lt;range;i++)<br> printf(“%ld “,arr[i]);<br> printf(“\nFibonacci Ends \n\n”);<br> delay(5000);<br> return 0;<br> }</p><p>Write A Program in C to Find Fibonacci series up to Nth terms (Use Of Array and FOR Loop)</p><p>Result:-<br> <br> Enter the number range: 20<br> Fibonacci series is: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181</p><p><em>Originally published at </em><a href="http://www.techdias.com/2016/08/fibonacci-series-using-array-and-for.html"><em>www.techdias.com</em></a><em> on August 23, 2016.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=de8346f041ba" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>