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

1 vote57 views1 answer
Create a response object python
Python
0 vote137 views1 answer
Locate certs path for python
Python
1 vote101 views1 answer
Date.month date time
Python
0 vote118 views2 answers
Matplotlib-Object oriented interface
Python
0 vote117 views1 answer
Python run async function without await
Python
0 vote106 views1 answer
Sns multiple distributions
Python
2 votes96 views1 answer
Python type of column
Python
0 vote103 views2 answers
Stackoverflow search
Python
1 vote108 views1 answer
Python test if list of dicts has key
Python
22 votes104 views1 answer
How to automatically copy an output to clipboard in python
Python