Comments on: Python Quicksort http://www.emgarten.com/python-quicksort.htm Exploring the realms of code.. Fri, 21 Jan 2011 01:27:47 -0800 http://wordpress.org/?v=2.8.5 hourly 1 By: Ashish http://www.emgarten.com/python-quicksort.htm/comment-page-1#comment-296 Ashish Fri, 26 Mar 2010 14:54:08 +0000 http://www.emgarten.com/python-quicksort.htm#comment-296 @Steve, your code won't work on following array >> qsort([2, 3, 4, 5, 6, 7, 8, 9, 10,11,12,2,3]) >> [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12] #skips duplicate values Correction: def qsort2(items): if not items : return items pivot = items[0] return qsort2(filter(lambda x : x pivot,items[1:])) >> qsort2([2, 3, 4, 5, 6, 7, 8, 9, 10,11,12,2,3]) >> [2, 2, 3, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12] @Steve, your code won’t work on following array

>> qsort([2, 3, 4, 5, 6, 7, 8, 9, 10,11,12,2,3])
>> [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12] #skips duplicate values

Correction:
def qsort2(items):
if not items : return items
pivot = items[0]
return qsort2(filter(lambda x : x pivot,items[1:]))

>> qsort2([2, 3, 4, 5, 6, 7, 8, 9, 10,11,12,2,3])
>> [2, 2, 3, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]

]]> By: Steve (Frostbyte) 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))

]]> By: Steve (Frostbyte) 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))

]]>