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
Get current url with parameters url django
Python Django
0 vote274 views2 answers
Generate random token or id in django
Python Django
1 vote201 views4 answers
Bogo Sort
Python
0 vote262 views1 answer
Python for loop get iteration number
Python
0 vote212 views1 answer
Recorrer lista desde el final python
Python
0 vote213 views1 answer
Django http response 204
Python
0 vote203 views1 answer
Python console width
Python
0 vote218 views1 answer
Smart Weather Information App Using Python
Python
0 vote211 views1 answer
Python string: string concatenation
Python
0 vote321 views1 answer
Flask app with spark
Python