-
Notifications
You must be signed in to change notification settings - Fork 0
/
QuickSort.py
29 lines (20 loc) · 829 Bytes
/
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
import random
arr = [random.randrange(100) for i in range(10)] # Creat random list
def checkSort(array) -> bool: # Function for check sort status
for i in range(len(array) - 1):
if array[i] > array[i + 1]: # If all elements less than the following then sorted is True
return True
return False
def quick(array): # Quick sort function
done = True
while done:
for i in range(len(array) - 1):
if array[i] > array[i + 1]:
point = array[i] # Creat point from sort
if array[i + 1] < point:
array[i], array[i + 1] = array[i + 1], array[i] # Replace elements
break
done = checkSort(array) # Check sorted status
return array
print(arr)
print(quick(arr))