Python version of the quick sort algorithm code

From , 3 Years ago, written in Python, viewed 228 times.

def qsort(L):
    return ((qsort([x for x in L[1:] if x < L[0]]) + L[0:1] +
             qsort([x for x in L[1:] if x >= L[0]])
            ) if L
            else [])
 
 
 

Reply to "Python version of the quick sort algorithm code"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Python version of the quick sort algorithm code

Reply to "Python version of the quick sort algorithm code"