The Zend Developer Zone has pointed out a new course that's offered by Zend to help experienced programmers further their PHP education - Zend Quick Start: PHP for Experienced Programmers.

This course covers many of the same topics as both the PHP I: Foundations and PHP II: Higher Structures classes but at an accelerated rate with special emphasis on the differences between PHP and other commonly used languages.

The next session of the course starts on April 29th and will last through May 16th. There will be nine sessions during that time for two hours at a time. You can get full details, including how to reserve your spot, on the course's page on the Zend website.

Previously from DevShed, they started a series on collections and sorting in PHP. Today, they've posted part two of the series that builds on that and looks at sorting algorithm examples.

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.