This article will examine the primary sorting algorithms with code examples, and some empirical data regarding how they perform in relation to one another, as well as the size of the data set in question.

We will also create a function to fill up our collection with random data in order to test the sort algorithms with a sufficiently large data set. The sort algorithms listed above are the ones that every computer science student learns in college and are the primary sort algorithms found in real-world applications.

The sorting styles they cover include: bubble sort, heap sort, merge sort, quick sort, and shell sort. For each, they provide the code, making it a simple matter of cut and paste to make it work in your script. There's not a whole lot of documentation going along with the code in this article, but the sorting code is simple enough to understand without it.]]> Wed, 05 Apr 2006 07:13:17 -0500 http://www.phpdeveloper.org/news/5066 http://www.phpdeveloper.org/news/5066 closer and closer, and a few of the members of the PHP community have been selected to present their proposed talks for this year's edition.

The list so far includes:

• David Sklar on web application dependencies
• Adam Trachtenberg giving his talk on the "Dirty secrets of PHP 5's ext/soap extension"
• Chris Shiflett (along with Geoff Young) covering PHP testing, including mentions of Apache-Test, Simple-Test, PHPUnit, and phpt

For more details or to sign up for the conference, visit their site and check out the long list of topics and tracks for this year's event.]]> Wed, 29 Mar 2006 07:41:11 -0600