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 vote148 views1 answer
Django save object in view
Python Django
0 vote123 views2 answers
Python youtube view bot
Python
4 votes119 views1 answer
Is python a good language to learn
Python
0 vote119 views1 answer
Switch case python 3.10
Python
0 vote109 views1 answer
Python pandas series to title case
Python
0 vote144 views1 answer
Django insert bulk data
Python Django
5 votes106 views2 answers
Python plot two lines on same graph
Python
1 vote120 views2 answers
Python delete key if exists
Python
0 vote115 views1 answer
Access CSV Files in Google Colab
Python
34 votes101 views6 answers
How to open a file in python
Python