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

20 votes320 views5 answers
List directory in python
Python
0 vote310 views1 answer
Get list of all document in django-elasticsearch-dsl
Python
17 votes276 views3 answers
Get last row of dataframe
Python
0 vote357 views1 answer
Equal Sides Of An Array python
Python
0 vote325 views1 answer
Python get host.docker.internal ip site:stackoverflow.com
Python
0 vote311 views1 answer
Pytorch freeze layers
Python
1 vote340 views1 answer
Ax tick params
Python
85 votes358 views4 answers
Create python executable
Python
0 vote498 views1 answer
Flask request file upload to dropbox
Python Flask
37 votes361 views6 answers
Lambda in python
Python