// archives

Archive for December 13th, 2009

PHP Quicksort Demonstration

While looking for a hip-pocket sorting, algorithm, I found some sample code here and thought it was perfect the way it was. function quicksort($seq) { if(!count($seq)) return $seq; $pivot= $seq[0]; $low = $high = array(); $length = count($seq); for($i=1; $i < $length; $i++) { if($seq[$i]

 

December 2009
S M T W T F S
« Sep   Jan »
 12345
6789101112
13141516171819
20212223242526
2728293031