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 vote103 views2 answers
Append two 1d arrays python
Python
4 votes106 views1 answer
Python spawn shell
Python
0 vote97 views1 answer
Django pull from Google Sheets
Python
0 vote113 views1 answer
Qq plot using seaborn
Python
21 votes104 views6 answers
Concatenate python
Python
0 vote103 views1 answer
Odoo create new admin user command line
Python
1 vote134 views1 answer
Django crispy forms foundation for site
Python
0 vote94 views1 answer
Bad request 400 heroku app
Python
1 vote108 views1 answer
Python zip extract directory
Python
1 vote101 views1 answer
Cmd run ps1 file in background
Python