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 vote149 views1 answer
Pyqt5 change table widget column width
Python
-2 votes160 views2 answers
Where to import reverse_lazy in django
Python Django
146 votes130 views6 answers
Install pip python
Python
-1 vote148 views1 answer
Python find if part of list is in list
Python
1 vote342 views1 answer
Check datatype python
Python
0 vote161 views1 answer
Pandas save csv list as columns
Python
52 votes142 views6 answers
Python sleep
Python
11 votes177 views3 answers
Python list except last element
Python
0 vote126 views1 answer
Gspread how to put shhet number in a variable
Python
0 vote161 views1 answer
Grouped bar chart with labels
Python