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 vote249 views1 answer
Torch.utils.data.random_split(dataset, lengths)
Python
3 votes250 views2 answers
List vs tuple
Python
0 vote251 views1 answer
Python class optional attributes
Python
2 votes223 views1 answer
Title() in python
Python
7 votes235 views1 answer
Python for loop with array
Python
0 vote233 views1 answer
Pytorch_starting
Python
0 vote232 views1 answer
Python break list into n lists
Python
0 vote225 views1 answer
Bs
Python
1 vote224 views1 answer
Discord.py send messages
Python
2 votes233 views1 answer
Color to black and white cv2
Python