-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquickSort.py
More file actions
72 lines (63 loc) · 1.81 KB
/
quickSort.py
File metadata and controls
72 lines (63 loc) · 1.81 KB
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#coding=utf-8
"""
Written by zxcode-123
------------------------------------------------------------
Usage:归并排序
"""
from generateNearlyOrdered import generateNearlyOrderedArray
from random import randint
# 方法一 随机去基准点pivot
def quickSort1(alist,left,right):
mid = partitionQS(alist, left,right)
quickSort(alist,left,mid-1)
quickSort(alist,mid+1,right)
return alist
def partitionQS(alist, left,right):
pos = randint(left,right)
alist[pos],alist[left] = alist[left],alist[pos]
v = alist[left]
i = left
j = left + 1
while(j<=r):
if(alist[j]<v):
alist[j],alist[i+1] = alist[i+1],alist[j]
i = i +1
j = j + 1
alist[left],alist[i] = alist[i],alist[left]
return i
# 方法一 三数取中(基准点pivot)
def quickSort(alist,left,right):
dealPivot(alist,left,right)
i = left
j = right
v = alist[right-1]
while(i <= j):
while(alist[i] < v):
i = i+1
while(alist[j]>v):
j = j - 1
alist[i],alist[j] = alist[j],alist[i]
i = i +1
j = j-1
if(left < j):
quickSort(alist,left,j);
if(right>i):
quickSort(alist,i,right)
return alist
def dealPivot(alist,left,right):
mid = (left+right)//2
if(alist[left]>alist[mid]):
alist[left],alist[mid] = alist[mid],alist[left]
if(alist[left]>alist[right]):
alist[left],alist[right] = alist[right],alist[left]
if(alist[mid]>alist[right]):
alist[mid],alist[right] = alist[mid],alist[right]
alist[mid],alist[right-1] = alist[mid],alist[right-1]
def test():
arr = generateNearlyOrderedArray(10,10)
print(arr)
alist = quickSort(arr,0,9)
print("------------------------------------------")
print(alist)
if __name__ == '__main__':
test()