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 vote152 views2 answers
Get the creating date of files ftp python
Python
0 vote127 views1 answer
Pandas map using two columns
Python
0 vote119 views1 answer
Python string color format
Python
1 vote145 views3 answers
Python ord()
Python
0 vote94 views1 answer
Algorithme pour afficher table de multiplication python
Python
0 vote116 views1 answer
Reveal a defined function in python
Python
0 vote132 views1 answer
Km/h to mph python
Python
2 votes121 views1 answer
Pip avticate venv
Python
0 vote373 views2 answers
Sum python
Python
1 vote116 views1 answer
Create list integers
Python