Help us understand the problem. What is going on with this article?


More than 3 years have passed since last update.

Learn You Haskell for Great Goodに出てくるquicksortを,リスト内包や再帰もそのままでpythonで作成。ただそれだけなんだけど,いつか何かの役に立つかもしれないので一応残しておこう。

def quicksort(x):
    if x==[]: return []

    smallerSorted = quicksort([a for a in x[1:] if a <= x[0]])
    biggerSorted = quicksort([a for a in x[1:] if a > x[0]])


x = [10,2,5,3,1,6,7,4,2,3,4,8,9]


[1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 9, 10]
Why not register and get more from Qiita?
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away