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

12 votes211 views2 answers
Convert list to array python
Python
1 vote262 views1 answer
Using bs4 to obtain html element by id
Python
0 vote228 views1 answer
Sum of values with none
Python
0 vote257 views1 answer
Setting flask app environment variable
Python Flask
0 vote325 views3 answers
Berlin
Python
1 vote210 views1 answer
Pip fuzzywuzzy
Python
0 vote234 views1 answer
Discordpy make all inputs lowercase
Python
0 vote202 views1 answer
Détruire une variable python
Python
0 vote213 views2 answers
Python closing socket good way
Python
5 votes232 views2 answers
A2+b2=c2 calculator
Python