<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss 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/" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" version="2.0">
<channel>
	<title>Comments for Algorithm Blogs</title>
	
	<link>http://www.algorithm.co.il/blogs</link>
	<description>Algorithms, for the heck of it</description>
	<lastBuildDate>Sat, 17 Jul 2010 15:10:17 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/CommentsForAlgorithmBlogs" /><feedburner:info uri="commentsforalgorithmblogs" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item>
		<title>Comment on Small Python Challenge No. 4 – Counting Sets by admin</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/5Nl1haMuLow/</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Sat, 17 Jul 2010 15:10:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=315#comment-44625</guid>
		<description>Anonymous: 
1. Each computation of D[i] may be considered equivalent to a comparison. 
2. Your solution does O(N) work for each given a.</description>
		<content:encoded><![CDATA[<p>Anonymous:<br />
1. Each computation of D[i] may be considered equivalent to a comparison.<br />
2. Your solution does O(N) work for each given a.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/5Nl1haMuLow" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/computer-science/small-python-challenge-no-4-counting-sets/comment-page-1/#comment-44625</feedburner:origLink></item>
	<item>
		<title>Comment on Small Python Challenge No. 4 – Counting Sets by Anonymous...</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/r1631ZBb_i4/</link>
		<dc:creator>Anonymous...</dc:creator>
		<pubDate>Tue, 15 Jun 2010 15:05:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=315#comment-43290</guid>
		<description>Yeah I think I must be misunderstanding something. Are set comparisons the only thing that costs time? If so, here's my solution...

1. compute D[i] = a - S[i] for each S[i]
2. count = 0
3. for each D[i], if len(D[i]) = 0, count = count + 1
4. print count

Yeah that doesn't really do any set comparisons. Probably not what you were going for. Posted for the lulz.</description>
		<content:encoded><![CDATA[<p>Yeah I think I must be misunderstanding something. Are set comparisons the only thing that costs time? If so, here&#8217;s my solution&#8230;</p>
<p>1. compute D[i] = a &#8211; S[i] for each S[i]<br />
2. count = 0<br />
3. for each D[i], if len(D[i]) = 0, count = count + 1<br />
4. print count</p>
<p>Yeah that doesn&#8217;t really do any set comparisons. Probably not what you were going for. Posted for the lulz.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/r1631ZBb_i4" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/computer-science/small-python-challenge-no-4-counting-sets/comment-page-1/#comment-43290</feedburner:origLink></item>
	<item>
		<title>Comment on One-liner Guitar Tuner in Python by Inger</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/atCZ_TCQ1L4/</link>
		<dc:creator>Inger</dc:creator>
		<pubDate>Fri, 23 Apr 2010 14:45:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=611#comment-41451</guid>
		<description>Nice! But it's not a deaf-friendly guitar tuner as the FFT tuner you wrote a few years ago :)

Got a new project for ya: check the influences of this one-liner on mosquitoes.</description>
		<content:encoded><![CDATA[<p>Nice! But it&#8217;s not a deaf-friendly guitar tuner as the FFT tuner you wrote a few years ago :)</p>
<p>Got a new project for ya: check the influences of this one-liner on mosquitoes.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/atCZ_TCQ1L4" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/one-liner-guitar-tuner-in-python/comment-page-1/#comment-41451</feedburner:origLink></item>
	<item>
		<title>Comment on 10 Python Optimization Tips and Issues by Luke Maurits » Blog Archive » Python vs C for performance</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/MQBF7bRyCqw/</link>
		<dc:creator>Luke Maurits » Blog Archive » Python vs C for performance</dc:creator>
		<pubDate>Thu, 22 Apr 2010 03:11:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=373#comment-41364</guid>
		<description>[...] Reddit today I came across a fairly decent article on Python optimization tips and issues, which comes across fairly heavily in favour of the idea that by being careful and knowing what [...]</description>
		<content:encoded><![CDATA[<p>[...] Reddit today I came across a fairly decent article on Python optimization tips and issues, which comes across fairly heavily in favour of the idea that by being careful and knowing what [...]</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/MQBF7bRyCqw" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/10-python-optimization-tips-and-issues/comment-page-1/#comment-41364</feedburner:origLink></item>
	<item>
		<title>Comment on Visualizing Data Using the Hilbert Curve by Pagefault</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/a2kFPyXujAE/</link>
		<dc:creator>Pagefault</dc:creator>
		<pubDate>Sat, 17 Apr 2010 07:29:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=525#comment-41134</guid>
		<description>Hey Imri,
Can you explain what extra information do you get from drawing the data as Hilbert curve instead of 2d table.

Cheers,
Pagefault.</description>
		<content:encoded><![CDATA[<p>Hey Imri,<br />
Can you explain what extra information do you get from drawing the data as Hilbert curve instead of 2d table.</p>
<p>Cheers,<br />
Pagefault.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/a2kFPyXujAE" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/visualizing-data-using-the-hilbert-curve/comment-page-1/#comment-41134</feedburner:origLink></item>
	<item>
		<title>Comment on Fuzz-Testing With Nose by R.</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/YrkYaHwaWl0/</link>
		<dc:creator>R.</dc:creator>
		<pubDate>Sun, 04 Apr 2010 02:00:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=587#comment-40478</guid>
		<description>Actually, instead of taking inputs from a uniform distribution, it may be better to sample them according to the following "monkey" distribution:
- Initialize the input to the default.
- Repeat the following a certain number of times (e.g., a Poisson distributed number of times):
- Select a random GUI element and "click" it (that is, change the input accordingly).

This gives more weight to inputs that your typical users tend to arrive at. Yes, they're lazy.</description>
		<content:encoded><![CDATA[<p>Actually, instead of taking inputs from a uniform distribution, it may be better to sample them according to the following &#8220;monkey&#8221; distribution:<br />
- Initialize the input to the default.<br />
- Repeat the following a certain number of times (e.g., a Poisson distributed number of times):<br />
- Select a random GUI element and &#8220;click&#8221; it (that is, change the input accordingly).</p>
<p>This gives more weight to inputs that your typical users tend to arrive at. Yes, they&#8217;re lazy.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/YrkYaHwaWl0" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/fuzz-testing-with-nose/comment-page-1/#comment-40478</feedburner:origLink></item>
	<item>
		<title>Comment on Fuzz-Testing With Nose by Trip itinerary generator engine testing | Plnnr.com blog</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/UtwQkt74sE8/</link>
		<dc:creator>Trip itinerary generator engine testing | Plnnr.com blog</dc:creator>
		<pubDate>Fri, 02 Apr 2010 19:59:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=587#comment-40448</guid>
		<description>[...] Read more about the technical details at algorithm.co.il [...]</description>
		<content:encoded><![CDATA[<p>[...] Read more about the technical details at algorithm.co.il [...]</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/UtwQkt74sE8" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/fuzz-testing-with-nose/comment-page-1/#comment-40448</feedburner:origLink></item>
	<item>
		<title>Comment on Fuzz-Testing With Nose by daonb</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/rI6yYkDVQ9A/</link>
		<dc:creator>daonb</dc:creator>
		<pubDate>Wed, 31 Mar 2010 07:34:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=587#comment-40292</guid>
		<description>Great post, thanks.

One suggestion for improvement is to add the seed and self.__name__ logging in fuzz_test's for loop.</description>
		<content:encoded><![CDATA[<p>Great post, thanks.</p>
<p>One suggestion for improvement is to add the seed and self.__name__ logging in fuzz_test&#8217;s for loop.</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/rI6yYkDVQ9A" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/programming/python/fuzz-testing-with-nose/comment-page-1/#comment-40292</feedburner:origLink></item>
	<item>
		<title>Comment on Call for Volunteers: Open Knesset – oknesset.org by Daniel Goldberg</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/7E9Auck6kJM/</link>
		<dc:creator>Daniel Goldberg</dc:creator>
		<pubDate>Fri, 26 Mar 2010 18:40:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=533#comment-39915</guid>
		<description>Correction: Your link seems to be the "official" link but is less updated (or just has a far worse UI theme)</description>
		<content:encoded><![CDATA[<p>Correction: Your link seems to be the &#8220;official&#8221; link but is less updated (or just has a far worse UI theme)</p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/7E9Auck6kJM" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/misc/call-for-volunteers-open-knesset-oknesset-org/comment-page-1/#comment-39915</feedburner:origLink></item>
	<item>
		<title>Comment on Call for Volunteers: Open Knesset – oknesset.org by Daniel Goldberg</title>
		<link>http://feedproxy.google.com/~r/CommentsForAlgorithmBlogs/~3/5Jlt1N4DdxY/</link>
		<dc:creator>Daniel Goldberg</dc:creator>
		<pubDate>Fri, 26 Mar 2010 18:31:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.algorithm.co.il/blogs/?p=533#comment-39913</guid>
		<description>הלינק כבר לא עדכני אם אני מבין נכון. 
אם אני מבין נכון, אתה צריך לעדכן לכתובת הבאה:
http://tzafim.org</description>
		<content:encoded><![CDATA[<p>הלינק כבר לא עדכני אם אני מבין נכון.<br />
אם אני מבין נכון, אתה צריך לעדכן לכתובת הבאה:<br />
<a href="http://tzafim.org" rel="nofollow">http://tzafim.org</a></p>
<img src="http://feeds.feedburner.com/~r/CommentsForAlgorithmBlogs/~4/5Jlt1N4DdxY" height="1" width="1"/>]]></content:encoded>
	<feedburner:origLink>http://www.algorithm.co.il/blogs/index.php/misc/call-for-volunteers-open-knesset-oknesset-org/comment-page-1/#comment-39913</feedburner:origLink></item>
</channel>
</rss>
