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

13 votes118 views4 answers
Python write list to text file
Python
0 vote107 views1 answer
Return more than one value python
Python
5 votes104 views2 answers
Pip pandas
Python
3 votes106 views2 answers
TypeError: 'numpy.ndarray' object is not callable
Python
1 vote101 views1 answer
Python numpy array size of n
Python
6 votes108 views6 answers
What is the best ide for python
Python
0 vote104 views1 answer
Python urlparse get domain
Python
1 vote144 views1 answer
How to make an simple python client
Python
0 vote103 views1 answer
Inverse box-cox transformation python
Python
0 vote102 views1 answer
Create table numpy
Python