Code Typing · Python
Quicksort
Recursive partition-based sort.
Difficulty: Intermediate · 10 Lines · License: public-domain
def quicksort(values):
if len(values) <= 1:
return values
pivot = values[len(values) // 2]
lo = [x for x in values if x < pivot]
mid = [x for x in values if x == pivot]
hi = [x for x in values if x > pivot]
return quicksort(lo) + mid + quicksort(hi)
Time0:00
Speed (WPM)0.0
Accuracy100.0%
Mistakes0
Live Keyboard
Next Key: D | Last Pressed: -
Progress: 0.0%
`
1
2
3
4
5
6
7
8
9
0
-
=
Q
W
E
R
T
Y
U
I
O
P
[
]
A
S
D
F
G
H
J
K
L
;
'
Z
X
C
V
B
N
M
,
.
/
Space
Timed Test Leaderboard
No results yet. Be the first to set a score.