<?xml version="1.0"?>
<rss version="2.0">
<channel>
  <title>Question of the Day - Performance category</title>
  <link>http://enigmastation.com:80/pebble/qotd/categories/Performance/</link>
  <description>Interesting questions and answers on Java</description>
  <language>en</language>
  <copyright>Joseph Ottinger</copyright>
  <lastBuildDate>Wed, 03 Dec 2008 14:32:00 GMT</lastBuildDate>
  <generator>Pebble (http://pebble.sourceforge.net)</generator>
  <docs>http://backend.userland.com/rss</docs>
  
  
  <item>
    <title>Is Math.sqrt expensive?</title>
    <link>http://enigmastation.com:80/pebble/qotd/2008/08/27/1219844520000.html</link>
    
      
      
        <description>
          From ##java: &amp;quot;If I was factorising all the numbers up to 1000000, would it be worth checking all primes up to sqrt(n) or would it be quicker to just check all primes up to that number, my tutor told me that the sqrt() function is expensive.&amp;quot;&lt;p&gt;&lt;a href=&#034;http://enigmastation.com:80/pebble/qotd/2008/08/27/1219844520000.html&#034;&gt;Read more...&lt;/a&gt;&lt;/p&gt;
        </description>
      
    
    
    
    <category>Performance</category>
    
    <category>Languages and JVM</category>
    
    <comments>http://enigmastation.com:80/pebble/qotd/2008/08/27/1219844520000.html#comments</comments>
    <guid isPermaLink="true">http://enigmastation.com:80/pebble/qotd/2008/08/27/1219844520000.html</guid>
    <pubDate>Wed, 27 Aug 2008 13:42:00 GMT</pubDate>
  </item>
  
  </channel>
</rss>
