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 vote165 views1 answer
Serialize keras model
Python
0 vote176 views3 answers
Repeat
Python
0 vote163 views1 answer
How to make python do something every x seconds
Python
0 vote183 views1 answer
Django get form data from post
Python Django
0 vote180 views1 answer
Removing stop words from the text
Python
18 votes164 views4 answers
Create a venv
Python
61 votes156 views6 answers
Get date and time python
Python
0 vote178 views1 answer
Affinity propagation cosine similarity python
Python
0 vote160 views1 answer
Fastest way to check odd or even in python
Python
0 vote159 views1 answer
Image loader RGB transform
Python