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 vote314 views1 answer
Python split path at level
Python
0 vote313 views1 answer
We want to estimate the cost of painting a property. Interior wall painting cost is Rs.18 per sq.ft. and exterior wall painting cost is Rs.12 per sq.ft.
Python
0 vote321 views1 answer
Pass context data with templateview in django
Python
0 vote313 views1 answer
Write the output of a function in a txt file
Python
0 vote335 views1 answer
Python cgi get raw post data
Python
0 vote307 views1 answer
How to install neat
Python
0 vote311 views1 answer
Slayer_coins_spent
Python
-1 vote328 views1 answer
Random forest classifier in python
Python
0 vote299 views1 answer
User passes test django
Python
-1 vote296 views1 answer
Multiple assignment python
Python