-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
57 lines (47 loc) · 1.01 KB
/
main.cpp
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
#include "Visualizer.cpp"
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <iostream>
int partition(int* a, int low, int high)
{
int lowIndex = low - 1;
int pivot = a[high];
for(int i = low; i < high; ++i)
{
if(a[i] <= pivot)
{
++lowIndex;
swap(lowIndex, i);
}
}
++lowIndex;
swap(lowIndex, high);
return lowIndex;
}
void quickSort(int* a, int low, int high)
{
if(low < high)
{
int pi = partition(a, low, high);
quickSort(a, low, pi - 1);
quickSort(a, pi + 1, high);
}
}
void visualizeQuickSort(int* a, int length)
{
quickSort(a, 0, length - 1);
}
int main(int argc, char* argv[])
{
srand(time(NULL));
delay = 1500;
length = 500;
std::cout<<"Enter the delay value (default=1500): ";
std::cin>>delay;
std::cout<<"Enter the length value (default=500): ";
std::cin>>length;
setUpGlutAndArray(argc, argv, visualizeQuickSort);
free(arr);
return 0;
}