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

35 votes145 views6 answers
Lambda python
Python
0 vote118 views1 answer
Python string: .format()
Python
0 vote116 views2 answers
Logging the terminal output to a file
Python
0 vote121 views1 answer
Python how to move multiple values from one list to another at once
Python
3 votes115 views1 answer
Split string into array every n characters python
Python
4 votes103 views2 answers
Change django admin title
Python
0 vote110 views1 answer
Opencv loop video
Python
0 vote131 views2 answers
Python seperate int into digit array
Python
5 votes104 views1 answer
Last element in list py
Python
0 vote130 views1 answer
Discord bot delete messages python
Python