A to the W

Here is a quick look at quick sort. // Pre: valid array // Post: returns an array sorted with the quick sort algorithm function quick_sort($values = array()) { if(count($values) $pivot) { $greater[] = $values[$j]; } else { $less[] = $values[$j]; } } return array_merge(quick_sort($less), array($pivot), quick_sort($greater)); }

As I was searching on Craigslist for a quick contract here or there to pay for my video game addictions and found some very angry people that made me laugh. I share:

While I was on the ye old college try I went ahead and ripped the guts of bubble sort and inserted insertion sort. It is very similar to bubble sort: /* Author: Anthony Wlodarski Created On: 1/18/10 Insertion Sort Function */ // Pre: valid array // Post: returns an array sorted with the bubble sort algorithm ...

I was just recently playing around and got to thinking I coded a bubble sort algorithm in everything from C to Scheme but not in PHP. So I took a good college try at it and this is what I came up with: /* Author: Anthony Wlodarski Created On: 1/18/10 Bubble Sort Function */ // Pre: ...