http://www.emgarten.com/python-quicksort.htm Exploring the realms of code.. Thu, 03 Dec 2009 02:03:16 -0800 http://wordpress.org/?v=2.8.5 hourly 1 http://www.emgarten.com/python-quicksort.htm/comment-page-1#comment-274 Steve (Frostbyte) Thu, 23 Oct 2008 15:24:47 +0000 http://www.emgarten.com/python-quicksort.htm#comment-274 def qsort(items): count = len(items) if count <= 1: return items pivot = items[0] return qsort(filter(lambda x: x < pivot, items)) + [pivot] + sort(filter(lambda x: x > pivot, items)) def qsort(items):
count = len(items)
if count <= 1:
return items
pivot = items[0]
return qsort(filter(lambda x: x < pivot, items)) + [pivot] + sort(filter(lambda x: x > pivot, items))

]]> http://www.emgarten.com/python-quicksort.htm/comment-page-1#comment-273 Steve (Frostbyte) Thu, 23 Oct 2008 15:24:05 +0000 http://www.emgarten.com/python-quicksort.htm#comment-273 def qsort(items): count = len(items) if count <= 1: return items pivot = items[0] return qsort(filter(lambda x: x pivot, items)) def qsort(items):
count = len(items)
if count <= 1:
return items
pivot = items[0]
return qsort(filter(lambda x: x pivot, items))

]]>