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 vote192 views1 answer
Get a list of ids from queryset django
Python Django
-1 vote155 views1 answer
Cannot import name 'httpresponse' from 'django.http'
Python
0 vote104 views2 answers
Python pandas apply function that returns multiple columns
Python
0 vote152 views1 answer
Python NameError: name 'io' is not defined
Python
-2 votes149 views1 answer
Ceil in python3
Python
0 vote139 views3 answers
How to add list in javascript
Python
8 votes110 views2 answers
Python selenium get image src
Python
1 vote138 views1 answer
What is kali
Python
2 votes192 views3 answers
Mongodb between two values
Python
0 vote146 views2 answers
How to remove zero after decimal float python
Python