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

19 votes305 views6 answers
Python server
Python
0 vote298 views1 answer
Download pytz python
Python
0 vote326 views1 answer
Tqdm in place
Python
1 vote303 views1 answer
Python second to last element in list
Python
0 vote333 views1 answer
Ordering column names sensibly in pandas
Python
0 vote322 views1 answer
Cumulative frequency for python dataframe
Python
0 vote311 views1 answer
How to parse timestamp in python
Python
2 votes359 views2 answers
Django-admin command not found
Python Django
1 vote339 views2 answers
Python single line comment
Python
0 vote312 views1 answer
How to insert item at specifc index python
Python