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 vote123 views1 answer
Postgresql connect with local machine in django
Python Django
8 votes147 views1 answer
Input stdout python
Python
0 vote137 views1 answer
NameError: name 'accuracy_score' is not defined
Python
5 votes157 views3 answers
How to extract zip file using python
Python
1 vote164 views1 answer
How to scroll by in selenium python
Python
2 votes172 views1 answer
Python sympy symbols
Python
0 vote189 views1 answer
Get table wikipedia
Python
0 vote133 views1 answer
Currelation matrix python
Python
4 votes141 views2 answers
Convert array to dataframe python
Python
0 vote143 views1 answer
How to increment date by one in python
Python