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

10 votes176 views3 answers
Check python 32 or 64
Python
0 vote215 views1 answer
Django Signup urls.py
Python Django
1 vote212 views1 answer
Sum values in django models
Python Django
84 votes220 views6 answers
Python loop through list
Python
28 votes198 views2 answers
How to create a datetime object in python
Python
6 votes177 views3 answers
Get particular columns from dataframe
Python
4 votes188 views2 answers
Python linux command
Python
0 vote190 views1 answer
Fibonacci sequence in python using a for loop
Python
1 vote197 views2 answers
How to add list as new row to pandas dataframe
Python
3 votes159 views3 answers
How to remove items from list in python
Python