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 vote275 views1 answer
Python hide details
Python
0 vote262 views1 answer
Timeout python
Python
0 vote309 views1 answer
Lineplot in plt
Python
5 votes279 views2 answers
Forgot django admin password
Python
0 vote319 views2 answers
Fetching data from multiple tables using related name in django
Python Django
0 vote276 views2 answers
Python trace table
Python
1 vote274 views1 answer
Get file name from url python
Python
0 vote360 views1 answer
If the value is not in dict return default
Python
0 vote245 views1 answer
Select first row of every group pandas
Python
3 votes277 views1 answer
Python convert png to ico
Python