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

8 votes132 views2 answers
Python "is"
Python
3 votes165 views3 answers
How to get median mode average of a python list
Python
0 vote194 views1 answer
Flask remove file after send_file
Python Flask
9 votes186 views2 answers
Keras model save
Python
0 vote158 views1 answer
Regular Expression to Stop at First Match
Python
0 vote167 views1 answer
Pip choose interpreter
Python
1 vote187 views1 answer
ModuleNotFoundError: No module named 'en_core_web_sm'
Python
0 vote176 views1 answer
Find & set values in pandas Dataframe
Python
3 votes156 views3 answers
AttributeError: 'str' object has no attribute 'decode' site:stackoverflow.com
Python
0 vote168 views1 answer
[E053] Could not read config.cfg from C:\Users\hp\AppData\Local\Programs\Python\Python37\lib\site-packages\resume_parser\degree\model\config.cfg
Python