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 vote207 views1 answer
Drop every other column pandas
Python
23 votes228 views6 answers
Check if a value is nan pandas
Python
0 vote248 views2 answers
ImportError: /usr/local/lib/python3.7/dist-packages/cv2/cv2.cpython-37m-arm-linux-gnueabihf.so: undefined symbol: __atomic_fetch_add_8
Python
58 votes191 views2 answers
Find an index of an item in a list python
Python
1 vote196 views1 answer
Insert missing data in pandas
Python
1 vote210 views1 answer
How many data types are specified to numeric values in python
Python
2 votes198 views1 answer
Arctan calculator
Python
1 vote172 views1 answer
How to change opencv capture resolution
Python
0 vote284 views1 answer
Vbscript shutdown remote computer
Python
0 vote206 views1 answer
How to create a scoreboard for the top 5 players in python
Python