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

5 votes133 views2 answers
Python check if a file is empty
Python
0 vote140 views1 answer
Create image tkinter set active background
Python
0 vote132 views1 answer
Qpushbutton clicked
Python
0 vote152 views1 answer
Python Split list into chunks using List Comprehension
Python
5 votes145 views6 answers
Valid Palindrome
Python
0 vote163 views2 answers
How to get current page url in django template
Python Django
0 vote183 views1 answer
Adding hyperlinks in streamlit table
Python
0 vote132 views1 answer
\u00a0
Python
0 vote141 views2 answers
Get last file in directory python
Python
12 votes135 views6 answers
Python hello world program
Python