-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort.py
53 lines (45 loc) · 1.22 KB
/
quicksort.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# quicksort
num_count = int(input())
arr = []
for i in range (0, num_count):
arr.append(int(input()))
def quick_sort(arr, start, end):
middle = int((start + end) / 2)
if arr[start] > arr[middle]:
temp = arr[start]
arr[start] = arr[middle]
arr[middle] = temp
if arr[middle] > arr[end]:
temp = arr[middle]
arr[middle] = arr[end]
arr[end] = temp
if arr[start] > arr[middle]:
temp = arr[start]
arr[start] = arr[middle]
arr[middle] = temp
if (end - start) > 2:
pivot = arr[middle]
temp = arr[end - 1]
arr[end - 1] = arr[middle]
arr[middle] = temp
i = start
j = end - 1
while 1:
i += 1
while arr[i] < pivot and i < end:
i += 1
j -= 1
while arr[j] > pivot and j > start:
j -= 1
if i >= j:
break
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
temp = arr[i]
arr[i] = arr[end - 1]
arr[end - 1] = temp
quick_sort(arr, start, i - 1)
quick_sort(arr, i + 1, end)
quick_sort(arr, 0, num_count - 1)
print(arr)