<?xml version="1.0"?>
<rss version="2.0">
  <channel>
    <title>PHPDeveloper.org</title>
    <link>http://www.phpdeveloper.org</link>
    <description>Up-to-the Minute PHP News, views and community</description>
    <language>en-us</language>
    <pubDate>Mon, 20 May 2013 15:30:39 -0500</pubDate>
    <ttl>30</ttl>
    <item>
      <title><![CDATA[Web Builder Zone: Quicksort Algorithm - Difference Between PHP and JavaScript]]></title>
      <guid>http://www.phpdeveloper.org/news/14656</guid>
      <link>http://www.phpdeveloper.org/news/14656</link>
      <description><![CDATA[<p>
On the Web Builder Zone there's a <a href="http://css.dzone.com/news/quicksort-algorithm-%E2%80%93">quick article</a> from <i>Stoimen Popov</i> showing a quicksort algorithm in both PHP and Javascript versions:
</p>
<blockquote>
Let me show you one sorting algorithm, perhaps the most known of all them - the quick sort, implemented both on PHP and JavaScript. Although the code look similar between both languages, there are few differences, that show the importance of the syntax knowledge!
</blockquote>
<p>
Most of the post is taken up with the two code examples - the PHP one sorting arrays with a for loop and a call to <a href="http://php.net/array_merge">array_merge</a> and the Javascript side pushing values into an array and calling "concat" on it to get the right values.
</p>]]></description>
      <pubDate>Wed, 16 Jun 2010 08:49:59 -0500</pubDate>
    </item>
    <item>
      <title><![CDATA[Gustav Eklundh' sBlog: Search Methods in PHP]]></title>
      <guid>http://www.phpdeveloper.org/news/10743</guid>
      <link>http://www.phpdeveloper.org/news/10743</link>
      <description><![CDATA[<p>
<i>Gustav Eklundh</i> has posted a whole series of search type implementations to his blog - here's the list so far:
</p>
<ul>
<li><a href="http://threebyte.eu/2008/07/29/quicksort-implemented-in-php/">Quicksort</a>
<li><a href="http://threebyte.eu/2008/07/29/gnome-sort-implemented-in-php/">Gnome sort</a>
<li><a href="http://threebyte.eu/2008/07/30/strand-sort-presented-in-php/">Strand sort</a>
<li><a href="http://threebyte.eu/2008/07/31/mergesort-implemented-in-php/">Merge sort</a>
</ul>
<p>
He briefly explains each of the sort methods in each of the posts, sometimes with links to external sources (like Wikipedia) for more information on the method.
</p>]]></description>
      <pubDate>Fri, 01 Aug 2008 13:45:22 -0500</pubDate>
    </item>
    <item>
      <title><![CDATA[PHP-Coding-Practices.com: How I Turned A Slow Array Sort Into A Quick One Using Quicksort Algorithm]]></title>
      <guid>http://www.phpdeveloper.org/news/8011</guid>
      <link>http://www.phpdeveloper.org/news/8011</link>
      <description><![CDATA[<p>
On the PHP-Coding-Practices site, there's a sort of <a href="http://php-coding-practices.com/peformance-optimization/how-i-turned-a-slow-array-sort-into-a-quick-one-using-the-quicksort-algorithmn/">case study posted</a> showing how the author (<i>Tim Koschuetzki</i>) took a chunk of code that was slow at sorting an array and sped it up dramatically using the Quicksort Algorithm.
</p>
<blockquote>
Today in the morning I had a very unusual programming job to do - or at least what is for me rather unusual. I was confronted with the question whether it is easy to implement the quicksort algorithmn to sort an array of arrays based on a key in the second-dimension of the array. Join me to find out.
</blockquote>
<p>
The key to <a href="http://php-coding-practices.com/peformance-optimization/how-i-turned-a-slow-array-sort-into-a-quick-one-using-the-quicksort-algorithmn/">the transformation</a> is an application of the <a href="http://en.wikipedia.org/wiki/Quicksort">Quicksort method</a> that applies a filter to the elements in the array and places items to the right and left of the pivot point. To illustrate the point, he includes both the pre-quicksort code and post-quicksort.
</p>]]></description>
      <pubDate>Fri, 08 Jun 2007 11:17:00 -0500</pubDate>
    </item>
  </channel>
</rss>
