Charles, I agree with your overall point, but I'm curious about the quicksort comment. Seeing as how the entire quicksort algorithm fits easily on a single page, how much "vastly harder" can its maintainability be? Just curious what you meant...
> -----Original Message----- > Not really. Loop unrolling is a standard example of a speed > optimization that increases code size and reduces > maintainability and reliability in exchange for execution > speed (sometimes). Quicksort trades a more complex > algorithm, vastly harder maintainability, and more code for > significantly improved execution. _______________________________________________ Unsubscribe or switch delivery mode: <http://www.realsoftware.com/support/listmanager/> Search the archives of this list here: <http://support.realsoftware.com/listarchives/lists.html>
