You're viewing a comment by John Mount and its responses.

July 11, 2008, 02:59

It is beautiful code, but a lot more attention needs to be paid to the production quality version. In particular most beautiful quicksorts take O(n^2) time on a list filled with identical items (see Tim Peters ch. in the Python Cookbook or my article Sorting In Anger.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Type the word "computer_65": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.