process wrote:
qsort can handle bigger lists it seems, making less recursive calls before finishing(quicksort blows the stack when sorting range(100,-1000,-1). qsort does more work though right? is there a way to speed up that?is the built-in sort not defined recursively?
what makes you think you can write a better sort than the built-in algorithm by typing in some toy quick-sort implementations from a "sorting for dummies" article?
</F> -- http://mail.python.org/mailman/listinfo/python-list
