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 vote188 views2 answers
P-norm of a vector python
Python
1 vote176 views1 answer
Get the system boot time in python
Python
5 votes191 views2 answers
Python get min max value from a dictionary
Python
1 vote249 views2 answers
Python extraer ultimo elemento lista
Python
1 vote181 views1 answer
Python pandas apply function to one column
Python
0 vote185 views2 answers
How to display csv in pandas
Python
0 vote210 views1 answer
Python plot arrays from matrix
Python
2 votes209 views1 answer
Pygame get screen width and height
Python
2 votes141 views1 answer
Select a value randomly in a set python
Python
1 vote171 views1 answer
Python append several values
Python