-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAlgorithmVisualizer.cpp
More file actions
225 lines (193 loc) · 7.56 KB
/
AlgorithmVisualizer.cpp
File metadata and controls
225 lines (193 loc) · 7.56 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
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
#include "AlgorithmVisualizer.h"
#include "Menu.h"
#include <SFML/Graphics.hpp>
#include <iostream>
#include <sstream>
#include <thread>
#include <chrono>
#include <algorithm>
using namespace std;
void AlgorithmVisualizer::promptForInput(sf::RenderWindow& window, sf::Font& font) {
data.clear();
sf::Text prompt("Enter number of elements:", font, 24);
prompt.setPosition(50, 50);
sf::Text inputText("", font, 24);
inputText.setPosition(50, 100);
string userInput;
bool inputComplete = false;
while (window.isOpen() && !inputComplete) {
sf::Event event;
while (window.pollEvent(event)) {
if (event.type == sf::Event::Closed) {
window.close();
}
if (event.type == sf::Event::TextEntered) {
if (event.text.unicode == '\b' && !userInput.empty()) {
userInput.pop_back();
} else if (isdigit(event.text.unicode)) {
userInput += static_cast<char>(event.text.unicode);
}
}
if (event.type == sf::Event::KeyPressed && event.key.code == sf::Keyboard::Enter) {
if (!userInput.empty()) {
inputComplete = true;
}
}
}
window.clear();
window.draw(prompt);
inputText.setString(userInput);
window.draw(inputText);
window.display();
}
int numElements = stoi(userInput);
for (int i = 0; i < numElements; ++i) {
userInput.clear();
inputComplete = false;
sf::Text elementPrompt("Enter element " + to_string(i + 1) + ":", font, 24);
elementPrompt.setPosition(50, 50);
while (window.isOpen() && !inputComplete) {
sf::Event event;
while (window.pollEvent(event)) {
if (event.type == sf::Event::Closed) {
window.close();
}
if (event.type == sf::Event::TextEntered) {
if (event.text.unicode == '\b' && !userInput.empty()) {
userInput.pop_back();
} else if (isdigit(event.text.unicode) || event.text.unicode == '-') {
userInput += static_cast<char>(event.text.unicode);
}
}
if (event.type == sf::Event::KeyPressed && event.key.code == sf::Keyboard::Enter) {
if (!userInput.empty()) {
inputComplete = true;
}
}
}
window.clear();
window.draw(elementPrompt);
inputText.setString(userInput);
window.draw(inputText);
window.display();
}
data.push_back(stoi(userInput));
displayArray(window, data);
this_thread::sleep_for(chrono::milliseconds(500));
}
}
int AlgorithmVisualizer::promptForTarget(sf::RenderWindow& window, sf::Font& font) {
sf::Text prompt("Enter value to search:", font, 24);
prompt.setPosition(50, 50);
sf::Text inputText("", font, 24);
inputText.setPosition(50, 100);
string userInput;
bool inputComplete = false;
while (window.isOpen() && !inputComplete) {
sf::Event event;
while (window.pollEvent(event)) {
if (event.type == sf::Event::Closed) {
window.close();
}
if (event.type == sf::Event::TextEntered) {
if (event.text.unicode == '\b' && !userInput.empty()) {
userInput.pop_back();
} else if (isdigit(event.text.unicode) || event.text.unicode == '-') {
userInput += static_cast<char>(event.text.unicode);
}
}
if (event.type == sf::Event::KeyPressed && event.key.code == sf::Keyboard::Enter) {
if (!userInput.empty()) {
inputComplete = true;
}
}
}
window.clear();
window.draw(prompt);
inputText.setString(userInput);
window.draw(inputText);
window.display();
}
return stoi(userInput);
}
void AlgorithmVisualizer::displayArray(sf::RenderWindow &window, const vector<int> &data, int highlight) {
window.clear();
float xPos = 50.0f;
for (int i = 0; i < data.size(); ++i) {
sf::RectangleShape bar(sf::Vector2f(30, data[i] * 5));
bar.setFillColor(i == highlight ? sf::Color::Red : sf::Color::White);
bar.setPosition(xPos, 500 - data[i] * 5);
window.draw(bar);
xPos += 40.0f;
}
window.display();
}
void AlgorithmVisualizer::runSearchAlgorithms(sf::RenderWindow& window, sf::Font& font) {
std::vector<std::string> searchOptions = {"Linear Search", "Binary Search", "Back"};
Menu searchMenu(searchOptions, window.getSize().x, window.getSize().y);
while (window.isOpen()) {
sf::Event event;
while (window.pollEvent(event)) {
if (event.type == sf::Event::Closed) {
window.close();
}
if (event.type == sf::Event::KeyPressed) {
if (event.key.code == sf::Keyboard::Up) {
searchMenu.moveUp();
} else if (event.key.code == sf::Keyboard::Down) {
searchMenu.moveDown();
} else if (event.key.code == sf::Keyboard::Enter) {
int selectedIndex = searchMenu.getSelectedIndex();
if (selectedIndex == 0) {
// Ejecuta Linear Search
} else if (selectedIndex == 1) {
// Ejecuta Binary Search
} else if (selectedIndex == 2) {
return; // Regresa al menú principal
}
}
}
}
window.clear();
searchMenu.draw(window, font);
window.display();
}
}
void AlgorithmVisualizer::runSortingAlgorithms(sf::RenderWindow& window, const sf::Font& font) {
std::vector<std::string> sortingOptions = {"Bubble Sort", "Selection Sort", "Insertion Sort", "Merge Sort", "Quick Sort", "Back"};
Menu sortingMenu(sortingOptions, window.getSize().x, window.getSize().y);
while (window.isOpen()) {
sf::Event event;
while (window.pollEvent(event)) {
if (event.type == sf::Event::Closed) {
window.close();
}
if (event.type == sf::Event::KeyPressed) {
if (event.key.code == sf::Keyboard::Up) {
sortingMenu.moveUp();
} else if (event.key.code == sf::Keyboard::Down) {
sortingMenu.moveDown();
} else if (event.key.code == sf::Keyboard::Enter) {
int selectedIndex = sortingMenu.getSelectedIndex();
if (selectedIndex == 0) {
// Ejecuta Bubble Sort
} else if (selectedIndex == 1) {
// Ejecuta Selection Sort
} else if (selectedIndex == 2) {
// Ejecuta Insertion Sort
} else if (selectedIndex == 3) {
// Ejecuta Merge Sort
} else if (selectedIndex == 4) {
// Ejecuta Quick Sort
} else if (selectedIndex == 5) {
return; // Regresa al menú principal
}
}
}
}
window.clear();
sortingMenu.draw(window, font);
window.display();
}
}
#include "SearchAndSortMethods.cpp"