Entry 3235

haskell quicksort in python

Submitted by anonymous on Feb. 20, 2010 at 12:11 p.m.
Language: Python. Code size: 178 bytes.

# python
def qs(l):
    if len (l) == 0:
        return []
    else:
        return qs (filter (lambda x: x <= l[0], l[1:])) + l[:1] + qs (filter(lambda x: x > l[0], l[1:]))

This snippet took 0.01 seconds to highlight.

Back to the Entry List or Home.

Delete this entry (admin only).