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

3 votes206 views2 answers
Godot restart scene
Python
1 vote181 views1 answer
Python convert to percentage
Python
0 vote177 views1 answer
Return a new RDD by applying a function to each element of this RDD.
Python
-1 vote163 views1 answer
Python code variable declaration
Python
1 vote195 views3 answers
Django reverse lazy
Python
13 votes176 views3 answers
Find the factorial of a given integer in python
Python
91 votes182 views6 answers
Create virtual environment python
Python
0 vote180 views1 answer
300 x 250 donut download
Python
0 vote186 views1 answer
Escape sequence in python
Python
0 vote162 views1 answer
Check palindrome in python using recursion
Python