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

0 vote168 views1 answer
Python3 yyyymmddhhmmss
Python
0 vote209 views1 answer
Django trim string whitespace
Python Django
2 votes169 views5 answers
Check boolean python
Python
0 vote162 views1 answer
Python get desktop environment
Python
0 vote180 views1 answer
List addition within a list comprehension
Python
0 vote207 views1 answer
Python token stealer
Python
24 votes403 views6 answers
Django update model
Python Django
-1 vote178 views2 answers
Pandas get column values distinct
Python
1 vote168 views1 answer
Add to empty string python
Python
8 votes163 views3 answers
Len python
Python