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 vote268 views2 answers
Torch.unsqueeze
Python
2 votes289 views1 answer
Python print show special characters
Python
204 votes391 views6 answers
Random int python
Python
0 vote331 views1 answer
How to return Fibbonaci(n) python
Python
0 vote281 views1 answer
Replace nat with date pandas
Python
-1 vote275 views3 answers
How to create a new file in terminal
Python
7 votes270 views5 answers
Unnamed 0 pandas
Python
0 vote281 views1 answer
Python intitialize a 2d matrix
Python
4 votes280 views1 answer
Np array value count
Python
0 vote270 views1 answer
Kroki - hello.dot
Python