Fastest sort python

def qsort(inlist):
    if inlist == []: 
        return []
    else:
        pivot = inlist[0]
        lesser = qsort([x for x in inlist[1:] if x < pivot])
        greater = qsort([x for x in inlist[1:] if x >= pivot])
        return lesser + [pivot] + greater

Source: stackoverflow.com

Similar codes

12 votes233 views6 answers
Convert decimal to binary in python
Python
18 votes205 views3 answers
Select specific rows from dataframe in python
Python
0 vote159 views6 answers
What is dii
Python
0 vote289 views1 answer
Resize cmd using python
Python
3 votes150 views1 answer
Exp in python
Python
1 vote223 views1 answer
How to run commands in repl.ot
Python
0 vote201 views1 answer
Snake water gun game in python
Python
0 vote237 views1 answer
Django snippet 800
Python Django
1 vote200 views1 answer
Python - removeempy space in a cell
Python
0 vote193 views1 answer
Python break out of function
Python