forked from brockellefson/IntrospectiveSortResearch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQuickSort.py
58 lines (46 loc) · 1.3 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
54
55
56
57
58
import pygame
from random import randint
import winsound
import time
pygame.init()
size = (500, 500)
window = pygame.display.set_mode((size))
pygame.display.set_caption("Quicksort")
black = pygame.Color(0, 0, 0)
white = pygame.Color(255, 255, 255)
ourlist = []
listLength = 100
xList, y, w = [], 0, 5
tmpX = 0
for i in range(listLength):
#ourlist.append(randint(0, 500))
ourlist.append(i+100)
xList.append(tmpX)
tmpX += w
def draw():
global xList, y, ourlist
for i in range(listLength):
pygame.draw.rect(window, white, (xList[i], y, w, ourlist[i]), 0)
def partition(arr, low, high):
i = (low - 1)
pivot = arr[high]
for j in range(low, high):
if arr[j] <= pivot:
i = i + 1
arr[i], arr[j] = arr[j], arr[i]
arr[i + 1], arr[high] = arr[high], arr[i + 1]
return (i + 1)
def quickSort(arr, low, high):
if low < high:
time.sleep(.1)
window.fill(black)
draw()
pygame.display.update()
winsound.Beep(1000, 5)
pi = partition(arr, low, high)
quickSort(arr, low, pi - 1)
quickSort(arr, pi + 1, high)
quickSort(ourlist, 0, listLength-1)
for event in pygame.event.get():
if event.type == pygame.QUIT:
pygame.quit()