<?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 for Connecting the dots</title>
	<atom:link href="http://benjaminbaka.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://benjaminbaka.wordpress.com</link>
	<description>The sky is not the limit</description>
	<pubDate>Fri, 05 Sep 2008 15:27:23 +0000</pubDate>
	<generator>http://wordpress.org/?v=MU</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on challenge #4, listing files recursively with Ruby by Korny</title>
		<link>http://benjaminbaka.wordpress.com/2008/02/16/challenge-4-listing-files-recursively-with-ruby/#comment-54</link>
		<dc:creator>Korny</dc:creator>
		<pubDate>Mon, 21 Jul 2008 07:02:04 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/2008/02/16/challenge-4-listing-files-recursively-with-ruby/#comment-54</guid>
		<description>You might also want to check the Ruby 'find' standard library :)
You can get the above down to:
require 'find'
def list(file_name)
  Find.find(file_name) do &#124;path&#124;
    puts path unless FileTest.directory?(path)
  end
end</description>
		<content:encoded><![CDATA[<p>You might also want to check the Ruby &#8216;find&#8217; standard library <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /><br />
You can get the above down to:<br />
require &#8216;find&#8217;<br />
def list(file_name)<br />
  Find.find(file_name) do |path|<br />
    puts path unless FileTest.directory?(path)<br />
  end<br />
end</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on challenge #5 Ruby Bubble Sort by bbaka</title>
		<link>http://benjaminbaka.wordpress.com/2008/02/22/challenge-5-ruby-bubble-sort/#comment-53</link>
		<dc:creator>bbaka</dc:creator>
		<pubDate>Fri, 20 Jun 2008 15:00:26 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/?p=27#comment-53</guid>
		<description>Exactly, you are right . I have been able to develope two other versions of the bubble and other things. They will be available in subsequent blogs</description>
		<content:encoded><![CDATA[<p>Exactly, you are right . I have been able to develope two other versions of the bubble and other things. They will be available in subsequent blogs</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Maximum Finder by bbaka</title>
		<link>http://benjaminbaka.wordpress.com/2008/01/14/maximum-finder/#comment-52</link>
		<dc:creator>bbaka</dc:creator>
		<pubDate>Fri, 20 Jun 2008 14:48:44 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/2008/01/14/maximum-finder/#comment-52</guid>
		<description>@David Madden
Cool, now i have learnt one useful way of using inject method. Thanks and keep those comments comming</description>
		<content:encoded><![CDATA[<p>@David Madden<br />
Cool, now i have learnt one useful way of using inject method. Thanks and keep those comments comming</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Maximum Finder by David Madden</title>
		<link>http://benjaminbaka.wordpress.com/2008/01/14/maximum-finder/#comment-51</link>
		<dc:creator>David Madden</dc:creator>
		<pubDate>Fri, 02 May 2008 14:56:46 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/2008/01/14/maximum-finder/#comment-51</guid>
		<description>This is a classic search algorithm.

Ruby has a nice method called inject which negates the need for an extra variable.

biggest = a.inject do &#124;biggest, num&#124;
  biggest &#62; num ? biggest : num
end

puts biggest

biggest starts at 0 and then becomes the value returned from the block on each iteration. num is the next number from the array.</description>
		<content:encoded><![CDATA[<p>This is a classic search algorithm.</p>
<p>Ruby has a nice method called inject which negates the need for an extra variable.</p>
<p>biggest = a.inject do |biggest, num|<br />
  biggest &gt; num ? biggest : num<br />
end</p>
<p>puts biggest</p>
<p>biggest starts at 0 and then becomes the value returned from the block on each iteration. num is the next number from the array.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ruby selection sort. by David Madden</title>
		<link>http://benjaminbaka.wordpress.com/2008/03/24/ruby-selection-sort/#comment-50</link>
		<dc:creator>David Madden</dc:creator>
		<pubDate>Fri, 02 May 2008 13:27:56 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/?p=33#comment-50</guid>
		<description>A little trick to make the swapping part a little more like ruby and less like java would be this:

a[i], a[min] = a[min], a[i]

one line and still readable sort of (i think)</description>
		<content:encoded><![CDATA[<p>A little trick to make the swapping part a little more like ruby and less like java would be this:</p>
<p>a[i], a[min] = a[min], a[i]</p>
<p>one line and still readable sort of (i think)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on challenge #5 Ruby Bubble Sort by chi</title>
		<link>http://benjaminbaka.wordpress.com/2008/02/22/challenge-5-ruby-bubble-sort/#comment-48</link>
		<dc:creator>chi</dc:creator>
		<pubDate>Tue, 01 Apr 2008 21:37:24 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/?p=27#comment-48</guid>
		<description>i think, that at line 2, you meant to set swap = false. otherwise, the swap variable wouldn't do anything for you. in line 11 you check if swap == false, but the way you have it right now, swap will never be false.

other then that, looks good! nice to see that you've tried to speed up bubble search a little bit by adding that swap variable.</description>
		<content:encoded><![CDATA[<p>i think, that at line 2, you meant to set swap = false. otherwise, the swap variable wouldn&#8217;t do anything for you. in line 11 you check if swap == false, but the way you have it right now, swap will never be false.</p>
<p>other then that, looks good! nice to see that you&#8217;ve tried to speed up bubble search a little bit by adding that swap variable.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Don&#8217;t be hard on yourself by yylex</title>
		<link>http://benjaminbaka.wordpress.com/2008/02/16/dont-be-hard-on-yourself/#comment-41</link>
		<dc:creator>yylex</dc:creator>
		<pubDate>Sat, 22 Mar 2008 03:55:30 +0000</pubDate>
		<guid isPermaLink="false">http://benjaminbaka.wordpress.com/?p=25#comment-41</guid>
		<description>You are right.</description>
		<content:encoded><![CDATA[<p>You are right.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
