Difference between revisions of "Talk:Introduction"
Jump to navigation
Jump to search
AaronDenney (talk | contribs) |
|||
| Line 6: | Line 6: | ||
:Perhaps an in-place quicksort? —[[User:Ashley Y|Ashley Y]] 04:24, 26 January 2006 (UTC) |
:Perhaps an in-place quicksort? —[[User:Ashley Y|Ashley Y]] 04:24, 26 January 2006 (UTC) |
||
| + | |||
| + | :Change the C to mergesort? Because that really is what the Haskell code does. (Okay, sure, it's a funny 3-way, bottom-up, lazy mergesort. Still.) -- [[User:AaronDenney|AaronDenney]] 19:55, 10 July 2007 (UTC) |
||
Revision as of 19:55, 10 July 2007
Added the quote by Graham Klyne.
Over the years I've received numerous complaints about the quicksort example. But none of the complainers sent me anything better so it's still here. Anyone want to come up with a better example?
--John Peterson 00:39, 26 January 2006 (UTC)
- Perhaps an in-place quicksort? —Ashley Y 04:24, 26 January 2006 (UTC)
- Change the C to mergesort? Because that really is what the Haskell code does. (Okay, sure, it's a funny 3-way, bottom-up, lazy mergesort. Still.) -- AaronDenney 19:55, 10 July 2007 (UTC)