<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>fibonacci | Student Projects</title>
	<atom:link href="https://studentprojects.in/tag/fibonacci/feed/" rel="self" type="application/rss+xml" />
	<link>https://studentprojects.in</link>
	<description>Microcontroller projects, Circuit Diagrams, Project Ideas</description>
	<lastBuildDate>Mon, 30 Dec 2013 17:48:15 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.1.7</generator>
	<item>
		<title>Java program to print Fibonacci sequence Recursive &#038; Non Recursive</title>
		<link>https://studentprojects.in/software-development/java/java-programs/basic/java-program-print-fibonacci-sequence-recursive-recursive/</link>
					<comments>https://studentprojects.in/software-development/java/java-programs/basic/java-program-print-fibonacci-sequence-recursive-recursive/#comments</comments>
		
		<dc:creator><![CDATA[Editorial Team]]></dc:creator>
		<pubDate>Mon, 07 Feb 2011 10:44:27 +0000</pubDate>
				<category><![CDATA[Basic Programs]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[non-recursive]]></category>
		<category><![CDATA[fibonacci]]></category>
		<guid isPermaLink="false">http://studentprojects.in/?p=1367</guid>

					<description><![CDATA[<p>The Fibonacci sequence is defined by the following rule. The first 2 values in the sequence are 1, 1. Every subsequent value is the sum of the 2 values preceding it. Write a Java program that uses both recursive and non-recursive functions to print the nth value of the Fibonacci sequence. /*Non Recursive Solution*/ import</p>
<p>The post <a href="https://studentprojects.in/software-development/java/java-programs/basic/java-program-print-fibonacci-sequence-recursive-recursive/">Java program to print Fibonacci sequence Recursive & Non Recursive</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></description>
										<content:encoded><![CDATA[<p>The Fibonacci sequence is defined by the following rule. The first 2 values in the sequence are 1, 1. Every subsequent value is the sum of the 2 values preceding it. Write a Java program that uses both recursive and non-recursive functions to print<br />
the nth value of the Fibonacci sequence.</p>
<pre lang="java" line="1">
/*Non Recursive Solution*/
import java.util.Scanner;
class Fib {
	public static void main(String args[ ]) {
		Scanner input=new Scanner(System.in);
		int i,a=1,b=1,c=0,t;
		System.out.println("Enter value of t:");
		t=input.nextInt();
		System.out.print(a);
		System.out.print(" "+b);
		for(i=0;i<t-2;i++) {
			c=a+b;
			a=b;
			b=c;
			System.out.print(" "+c);
		}
		System.out.println();
		System.out.print(t+"th value of the series is: "+c);
	}
}
</pre>
<pre lang="java" line="1">
/* Recursive Solution*/
import java.io.*;
import java.lang.*;
class Demo {
	int fib(int n) {
		if(n==1)
			return (1);
		else if(n==2)
			return (1);
		else
			return (fib(n-1)+fib(n-2));
	}
}
class RecFibDemo {
	public static void main(String args[])throws IOException {
		InputStreamReader obj=new InputStreamReader(System.in);
		BufferedReader br=new BufferedReader(obj);
		System.out.println("enter last number");
		int n=Integer.parseInt(br.readLine());
		Demo ob=new Demo();
		System.out.println("fibonacci series is as follows");
		int res=0;
		for(int i=1;i<=n;i++) {
			res=ob.fib(i);
			System.out.println(" "+res);
		}
		System.out.println();
		System.out.println(n+"th value of the series is "+res);
	}
}
</pre><p>The post <a href="https://studentprojects.in/software-development/java/java-programs/basic/java-program-print-fibonacci-sequence-recursive-recursive/">Java program to print Fibonacci sequence Recursive & Non Recursive</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></content:encoded>
					
					<wfw:commentRss>https://studentprojects.in/software-development/java/java-programs/basic/java-program-print-fibonacci-sequence-recursive-recursive/feed/</wfw:commentRss>
			<slash:comments>11</slash:comments>
		
		
			</item>
		<item>
		<title>Java program to find Fibonacci series of a given number</title>
		<link>https://studentprojects.in/software-development/java/java-programs/basic/java-program-find-fibonacci-series-number/</link>
					<comments>https://studentprojects.in/software-development/java/java-programs/basic/java-program-find-fibonacci-series-number/#comments</comments>
		
		<dc:creator><![CDATA[surajk]]></dc:creator>
		<pubDate>Fri, 04 Feb 2011 12:29:19 +0000</pubDate>
				<category><![CDATA[Basic Programs]]></category>
		<category><![CDATA[Source Codes]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[lab programs]]></category>
		<category><![CDATA[fibonacci]]></category>
		<guid isPermaLink="false">http://studentprojects.in/?p=1322</guid>

					<description><![CDATA[<p>Java program to find Fibonacci series of a given number /*Write a program to find Fibonacci series of a given no. Example : Input - 8 Output - 1 1 2 3 5 8 13 21 */ class Fibonacci{ public static void main(String args[]){ int num = Integer.parseInt(args[0]); //taking no. as command line argument. System.out.println("*****Fibonacci</p>
<p>The post <a href="https://studentprojects.in/software-development/java/java-programs/basic/java-program-find-fibonacci-series-number/">Java program to find Fibonacci series of a given number</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></description>
										<content:encoded><![CDATA[<p>Java program to find Fibonacci series of a given number</p>
<pre lang="java" line="1">
/*Write a program to find Fibonacci series of a given no.
  Example :
  Input - 8
  Output - 1 1 2 3 5 8 13 21
 */
class Fibonacci{
	public static void main(String args[]){
		int num = Integer.parseInt(args[0]); //taking no. as command line
		argument.
			System.out.println("*****Fibonacci Series*****");
		int f1, f2=0, f3=1;
		for(int i=1;i<=num;i++){
			System.out.print(" "+f3+" ");
			f1 = f2;
			f2 = f3;
			f3 = f1 + f2;
		}
	}
}
</pre><p>The post <a href="https://studentprojects.in/software-development/java/java-programs/basic/java-program-find-fibonacci-series-number/">Java program to find Fibonacci series of a given number</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></content:encoded>
					
					<wfw:commentRss>https://studentprojects.in/software-development/java/java-programs/basic/java-program-find-fibonacci-series-number/feed/</wfw:commentRss>
			<slash:comments>67</slash:comments>
		
		
			</item>
	</channel>
</rss>
