-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquick_sort.py
More file actions
51 lines (41 loc) · 1.03 KB
/
quick_sort.py
File metadata and controls
51 lines (41 loc) · 1.03 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
# coding=utf-8
from typing import List
class QuickSort(object):
def partition(self, arr: List[int], low: int, high: int) -> int:
"""
:param arr:
:param low:
:param high:
:return:
"""
pivot, i, j = arr[low + (high - low) // 2], low, high
while True:
while arr[i] < pivot:
i += 1
while arr[j] > pivot:
j -= 1
if i >= j:
return j
arr[i], arr[j] = arr[j], arr[i]
i += 1
j -= 1
def sort(self, arr: List[int], low: int, high: int):
"""
:param arr:
:param low:
:param high:
:return:
"""
if low >= high:
return
k = self.partition(arr, low, high)
self.sort(arr, low, k)
self.sort(arr, k + 1, high)
def sort(self, arr: List[int]):
"""
:param arr:
:return:
"""
if not arr:
return
self.sort(arr, 0, len(arr) - 1)