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 vote219 views1 answer
Travis deployment script for django applications to heroku
Python
75 votes220 views2 answers
Python write to file while reading
Python
7 votes282 views2 answers
From distutils.util import strtobool ModuleNotFoundError: No module named 'distutils.util'
Python
1 vote209 views1 answer
How to make a hidden file in python
Python
0 vote261 views2 answers
Set environment variable heroku django
Python Django
0 vote257 views1 answer
How to insert a placeholder text in django modelform
Python Django
0 vote224 views1 answer
Python round without math
Python
0 vote227 views1 answer
Holding a function to the code in python
Python
3 votes225 views1 answer
Esp32 micropython timer
Python
0 vote212 views1 answer
Python all available paths
Python