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

5 votes168 views3 answers
Os system python
Python
-1 vote187 views1 answer
How to enable matplotlib in notebook
Python
6 votes153 views1 answer
Gtts
Python
1 vote147 views1 answer
Python requests set user agent
Python
0 vote147 views1 answer
Store in a variable the ocntent of a file python
Python
0 vote166 views2 answers
Def conditional_impute(input_df, choice='median')
Python
0 vote146 views1 answer
Pandas read google sheet
Python
8 votes155 views2 answers
New dataframe based on certain row conditions
Python
0 vote199 views1 answer
Pytorch inverse
Python
0 vote191 views1 answer
Two input number sum in python
Python