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 vote249 views1 answer
Pd.DataFrame(lm.coef_,X.columns,columns=['Coeff'])
Python
2 votes214 views1 answer
Add list to end of list python
Python
0 vote244 views1 answer
Read_csv only certain columns
Python
0 vote243 views1 answer
Import external script in django views
Python
3 votes241 views1 answer
Numpy array count frequency
Python
2 votes255 views1 answer
Distribution seaborn
Python
0 vote265 views1 answer
Https://stackoverflow.com/questions/7066121/how-to-set-a-single-main-title-above-all-the-subplots-with-pyplot
Python
0 vote235 views1 answer
Django how to create superuser if does not exists on migration
Python
1 vote247 views1 answer
Previous value list loop python
Python
3 votes256 views2 answers
Python change cwd to script directory
Python