/
main.cpp
321 lines (292 loc) · 10.3 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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
// All necessary includes
#include <random>
#include <vector>
#include <time.h>
#include <SDL2/SDL.h>
#include <algorithm>
#include <fstream>
#include <string.h>
// Local header files
#include "sortAlgorithms.hpp"
#include "sdl2Functions.hpp"
/*
### Read the file and update the variables used for visualization.
---
#### Input:
- algorithm - an integer that indicates which algorithm will be visualized,
- numberOfElements - integer, which indicates the number of elements
that will be visualized,
- windowWidth - width of the window that will show up when the program
starts up,
- delayTime - time between each iteration of the algorithm execution,
- typeOfVisualization - the type of visualization that will be presented.
---
#### Output:
- true if the file was read correctly,
- false if the file was not read correctly.
*/
bool readFromFile(unsigned int* algorithm,
unsigned int* numberOfElements,
unsigned int* windowWidth,
unsigned int* windowHeight,
unsigned int* delayTime,
char* typeOfVisualization);
// Main
int main(int argc, char *argv[])
{
// Variables that are loaded from settings.txt
unsigned int algorithm;
unsigned int numberOfElements;
unsigned int windowWidth;
unsigned int windowHeight;
unsigned int delayTime;
char typeOfVisualization = ' ';
// Trying to read data from file
if(readFromFile(&algorithm, &numberOfElements, &windowWidth,
&windowHeight, &delayTime, &typeOfVisualization))
{
// Delcarating vector which will be populated with random numbers
std::vector<int> vectorToSort;
// Populating vector
srand(time(0));
for (int i = 0; i < numberOfElements; i++)
{
vectorToSort.push_back(10 + (rand() % windowHeight - 10));
}
// Setup window
SDL_Init(SDL_INIT_VIDEO);
SDL_Window* window = nullptr; // Identify window pointer
SDL_Renderer* renderer = nullptr; // Identify render pointer
SDL_CreateWindowAndRenderer(windowWidth, windowHeight,
0, &window, &renderer);
SDL_RenderSetScale(renderer, 1, 1);
// Choose proper algorithm to sort data
switch (algorithm)
{
// Bubble sort has been chosen
case 1:
bubbleSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Bucket sort has been chosen
case 2:
bucketSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Counting sort has been chosen
case 3:
countingSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Gnome sort has been chosen
case 4:
gnomeSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Heap sort has been chosen
case 5:
heapSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Insertion sort has been chosen
case 6:
insertionSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Merge sort has been chosen
case 7:
mergeSort(
vectorToSort, 0, vectorToSort.size()-1,
renderer, windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Quick sort has been chosen
case 8:
quickSort(
vectorToSort, 0, vectorToSort.size() - 1,
renderer, windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Radix sort has been chosen
case 9:
radixSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
// Selection sort has been chosen
case 10:
selectionSort(
vectorToSort, renderer,
windowWidth, windowHeight,
delayTime, typeOfVisualization);
break;
}
// Check if all elements are sorted and visualise it with green color
if (std::is_sorted(std::begin(vectorToSort), std::end(vectorToSort)))
{
for(int i = 0; i < vectorToSort.size(); i++)
{
drawFinalState(vectorToSort, renderer,
windowWidth, windowHeight,
i, typeOfVisualization, 2);
}
}
else printf("ERROR\n");
// Exit
SDL_DestroyWindow(window);
SDL_DestroyRenderer(renderer);
return EXIT_SUCCESS;
}
// The program will display a message that there was a problem with the settings.txt file
else
{
SDL_ShowSimpleMessageBox(
SDL_MESSAGEBOX_ERROR,
"ERROR SETTINGS.TXT",
"There was a problem with the settings.txt file. Make sure that such a file exists and that all parameters are correct.",
NULL);
return EXIT_FAILURE;
}
}
bool readFromFile( unsigned int* algorithm,
unsigned int* numberOfElements,
unsigned int* windowWidth,
unsigned int* windowHeight,
unsigned int* delayTime,
char* typeOfVisualization)
{
// Initialization of the file
std::fstream initDataFile;
// Opening file
initDataFile.open("settings.txt", std::ios::in);
// Trying to read data from file
if(initDataFile.is_open())
{
// Current line of txt file
std::string line;
// Which line of choice. 0 - algorithm, 1 - resolution etc.
unsigned int whichChoice = 0;
// Number entered by the user after "choice"
std::string numberString = "";
// Reading file
while(getline(initDataFile, line))
{
// Finding word choice for setting up variables
//
// Algorithm
if (line.substr(0,6) == "Choice" && whichChoice == 0)
{
for (char c : line)
{
if ((int)c >= 48 && (int)c <= 57)
{
numberString.push_back(c);
}
}
// Check if number is correct
if(numberString == "") goto terminate;
*algorithm = std::stoi(numberString);
++whichChoice;
}
// Resolution
else if (line.substr(0,6) == "Choice" && whichChoice == 1)
{
// allowX variable checks if there is a number before or behind 'x'
bool allowX = false;
bool xApperance = false;
for (char c : line)
{
if(c == 'x' || c == 'X')
{
if(numberString == "" || allowX == false) goto terminate;
*windowWidth = std::stoi(numberString);
numberString = "";
xApperance = true;
continue;
}
if ((int)c >= 48 && (int)c <= 57)
{
allowX = true;
numberString.push_back(c);
}
}
// Check if number is correct
if(numberString == "" || xApperance == false) goto terminate;
*windowHeight = std::stoi(numberString);
++whichChoice;
}
// Number of elements
else if (line.substr(0,6) == "Choice" && whichChoice == 2)
{
for (char c : line)
{
if ((int)c >= 48 && (int)c <= 57)
{
numberString.push_back(c);
}
}
// Check if number is correct
if (numberString == "") goto terminate;
*numberOfElements = std::stoi(numberString);
++whichChoice;
}
// Delay time
else if (line.substr(0,6) == "Choice" && whichChoice == 3)
{
for (char c : line)
{
if ((int)c >= 48 && (int)c <= 57)
{
numberString.push_back(c);
}
}
// Check if number is correct
if(numberString == "") goto terminate;
*delayTime = std::stoi(numberString);
++whichChoice;
}
// Type of visualization
else if (line.substr(0,6) == "Choice" && whichChoice == 4)
{
for (char c : line)
{
if (c == 'L' || c == 'l')
*typeOfVisualization = 'L';
else if (c == 'D' || c == 'd')
*typeOfVisualization = 'D';
}
// Check if type of visualization is correct
if(*typeOfVisualization == ' ') goto terminate;
++whichChoice;
}
numberString = "";
}
// Check whether all settings have been entered
if (whichChoice == 5)
{
initDataFile.close();
return true;
}
else goto terminate;
}
// settings.txt could not be opened
else
{
terminate:
initDataFile.close();
return false;
}
}