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

0 vote123 views2 answers
Importerror: cannot import name
Python
-1 vote89 views1 answer
What is mi casa in spanish
Python
0 vote131 views1 answer
Python how to count number of true
Python
0 vote167 views1 answer
Docker-compose.yml for flask celery rabbitmq
Python Flask
3 votes165 views2 answers
Django change user password
Python Django
0 vote128 views1 answer
How to convert pdf to word using python
Python
0 vote129 views1 answer
Python strong type
Python
0 vote161 views1 answer
Get a list of ids from queryset django
Python Django
1 vote130 views1 answer
Choromap = go.Figure(data=[data], layout = layout)
Python
0 vote117 views1 answer
Join mulitple dataframe pandas index
Python