回答編集履歴
1
コードの修正
answer
CHANGED
@@ -15,12 +15,11 @@
|
|
15
15
|
def quick_sort(a, first, last):
|
16
16
|
if first < last:
|
17
17
|
pivot = a[last]
|
18
|
-
i = first
|
18
|
+
i = first
|
19
19
|
for j in range(first, last):
|
20
20
|
if a[j] <= pivot:
|
21
|
+
a[i], a[j] = a[j], a[i]
|
21
22
|
i += 1
|
22
|
-
a[i], a[j] = a[j], a[i]
|
23
|
-
i += 1
|
24
23
|
a[i], a[last] = a[last], a[i]
|
25
24
|
quick_sort(a, first, i-1)
|
26
25
|
quick_sort(a, i+1, last)
|