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

1 vote286 views1 answer
Rum system commands python
Python
0 vote278 views1 answer
Ordenar lista decrescente python
Python
0 vote315 views1 answer
Cin python
Python
1 vote282 views1 answer
Look through dict
Python
0 vote318 views1 answer
For an HTML output, you don’t need an additional library. It simply goes like this:
Python
0 vote291 views1 answer
Run all python files in a directory in bash
Python
0 vote319 views1 answer
Make a effective figure in python
Python
0 vote305 views1 answer
Plot every nth label in barplot
Python
43 votes291 views5 answers
Import sklearn
Python
6 votes302 views2 answers
Square a number in python
Python