<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Fibonacci in Java</title>
	<atom:link href="http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/feed" rel="self" type="application/rss+xml" />
	<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java</link>
	<description></description>
	<lastBuildDate>Fri, 09 Jul 2010 16:22:10 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Rajesh</title>
		<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/comment-page-1#comment-8374</link>
		<dc:creator>Rajesh</dc:creator>
		<pubDate>Tue, 26 May 2009 20:49:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java#comment-8374</guid>
		<description>Here is a program that does the same by using recursion. You should be familiar with such problems as well. &lt;b&gt;&lt;a href=&quot;http://flapdoor.blogspot.com/2009/05/java-program-fibonacci-example.html&quot; rel=&quot;nofollow&quot;&gt;Link&lt;/a&gt;&lt;/b&gt;</description>
		<content:encoded><![CDATA[<p>Here is a program that does the same by using recursion. You should be familiar with such problems as well. <b><a href="http://flapdoor.blogspot.com/2009/05/java-program-fibonacci-example.html" rel="nofollow">Link</a></b></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Philips Tel</title>
		<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/comment-page-1#comment-4237</link>
		<dc:creator>Philips Tel</dc:creator>
		<pubDate>Sun, 09 Nov 2008 06:00:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java#comment-4237</guid>
		<description>Thank a lot for the script.</description>
		<content:encoded><![CDATA[<p>Thank a lot for the script.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jeff F.</title>
		<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/comment-page-1#comment-208</link>
		<dc:creator>Jeff F.</dc:creator>
		<pubDate>Mon, 28 Jan 2008 17:51:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java#comment-208</guid>
		<description>Speaking of Fibonacci... check out how the band Tool uses Fibonacci in their song Lateralus:

http://youtube.com/watch?v=wS7CZIJVxFY

.... Pretty cool stuff ....</description>
		<content:encoded><![CDATA[<p>Speaking of Fibonacci&#8230; check out how the band Tool uses Fibonacci in their song Lateralus:</p>
<p><a href="http://youtube.com/watch?v=wS7CZIJVxFY" rel="nofollow">http://youtube.com/watch?v=wS7CZIJVxFY</a></p>
<p>&#8230;. Pretty cool stuff &#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pieter</title>
		<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/comment-page-1#comment-148</link>
		<dc:creator>Pieter</dc:creator>
		<pubDate>Mon, 07 Jan 2008 22:19:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java#comment-148</guid>
		<description>you can do this a lot simpler.
Using the Scanner to read the next int would get rid of that try catch and makes stuff a lot easier.

here&#039;s how i would do it...

import java.util.Scanner;

public class Fibonacci {

	public static void main(String[] args) {
		System.out.println(&quot;How many numbers of the sequence would you like?&quot;);

		// Create a SCanner that reads input from console
		Scanner scanner = new Scanner(System.in);

		// Get first int from scanner
		int n = scanner.nextInt();

		// Start Fibonacci algorithm
		fibonacci(n);
	}

	public static void fibonacci(int n) {
		int a = 0, b = 1;

		for (int i = 0; i </description>
		<content:encoded><![CDATA[<p>you can do this a lot simpler.<br />
Using the Scanner to read the next int would get rid of that try catch and makes stuff a lot easier.</p>
<p>here&#8217;s how i would do it&#8230;</p>
<p>import java.util.Scanner;</p>
<p>public class Fibonacci {</p>
<p>	public static void main(String[] args) {<br />
		System.out.println(&#8221;How many numbers of the sequence would you like?&#8221;);</p>
<p>		// Create a SCanner that reads input from console<br />
		Scanner scanner = new Scanner(System.in);</p>
<p>		// Get first int from scanner<br />
		int n = scanner.nextInt();</p>
<p>		// Start Fibonacci algorithm<br />
		fibonacci(n);<br />
	}</p>
<p>	public static void fibonacci(int n) {<br />
		int a = 0, b = 1;</p>
<p>		for (int i = 0; i</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fibonacci in Ruby</title>
		<link>http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java/comment-page-1#comment-147</link>
		<dc:creator>Fibonacci in Ruby</dc:creator>
		<pubDate>Sun, 06 Jan 2008 19:23:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.zacharyfox.com/blog/fibonacci-project/fibonacci-in-java#comment-147</guid>
		<description>[...]      &#171; Fibonacci in Python Fibonacci in Java [...]</description>
		<content:encoded><![CDATA[<p>[...]      &laquo; Fibonacci in Python Fibonacci in Java [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
