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 vote365 views1 answer
Python generator in while loop
Python
9 votes406 views1 answer
Create models in django
Python Django
2 votes372 views1 answer
How to create a loop in python turtle
Python
29 votes353 views6 answers
Python empty dataframe
Python
8 votes381 views3 answers
Python print version
Python
0 vote335 views1 answer
Python get bits from byte
Python
0 vote328 views2 answers
Register temporary table pyspark
Python
1 vote335 views1 answer
Python in
Python
0 vote339 views1 answer
Name =input ("hello how are you ") if name==("good"): print ("Thats nice") else print("stfu")
Python
0 vote319 views1 answer
How to get started with flask
Python