-1)
goto LOOP;

echo implode(', ', $L)."\n\n";
}
?>


In any language where you don’t have to explicitly initialize an array’s size, it is implicitly being initialized to a default size, and any time you try to add an element beyond the size of the array, a new, larger array must be allocated, and the contents of the first array copied to the second array. There’s no such thing as magic arrays that can change size at no cost.

Because of this, your solution is actually potentially VERY slow, depending on the highest value of an integer in the list to sort, and how often the array must be reallocated and copied. It’s important to know how things work under the covers to understand their performance implications.

Second comment: this algorithm is NOT linear. There’s no such thing as a linear sorting algorithm. O(n log n) is the best that’s possible. Here is an explanation on why radix sort is actually O(n log n): http://www.jimloy.com/computer/radix.htm

see http://en.wikipedia.org/wiki/Counting_sort