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 vote337 views1 answer
Text replace
Python
0 vote341 views3 answers
System.Windows.Forms.DataGridView.CurrentRow.get returned null. c#
Python
4 votes350 views5 answers
Seaborn countplot
Python
1 vote335 views1 answer
How to construct simple timedelta in python
Python
0 vote394 views1 answer
Validate delete inline formset django
Python Django
7 votes371 views4 answers
From django.contrib import messages
Python Django
8 votes328 views1 answer
Python get keypressed value
Python
0 vote342 views2 answers
How to close a flask web server with python
Python
3 votes294 views1 answer
Endswith python
Python
27 votes364 views4 answers
How to do a square root in python
Python