sorting-algorithms/main.cpp at main · javier-adrian/sorting-algorithms · GitHub

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
#include "algorithms.cpp"
#include "util.cpp"

int main() {
    int array[SIZE];

    for (int i = 0; i < SIZE; i++) {
        array[i] = i + 1;
    }

    std::random_shuffle(std::begin(array) + 1, std::end(array));

    // ----------------------------------------------------------------------------------------------------------------

    int width = WIDTH;
    int height = HEIGHT;

    raylib::Window window(width, height, "raylib-cpp - basic window");

    SetTargetFPS(60);

    // ----------------------------------------------------------------------------------------------------------------

    int n = 0;

    int lowest = 0;
    int current = 0;
    int verified = 0;

    MODE mode = SELECTION;

    bool paused = false;

    // ----------------------------------------------------------------------------------------------------------------

    while (!window.ShouldClose())
    {
        if (IsKeyReleased(KEY_SPACE))
            paused = !paused;
        if (IsKeyReleased(KEY_ONE))
            switchMode(array, n, current, lowest, verified, mode, paused, SELECTION);
        if (IsKeyReleased(KEY_TWO))
            switchMode(array, n, current, lowest, verified, mode, paused, BUBBLE);
        if (IsKeyReleased(KEY_THREE))
            switchMode(array, n, current, lowest, verified, mode, paused, INSERTION);


        if (n < SIZE) {
            if (!paused) {
                switch (mode) {
                    case SELECTION:
                        selectionSort(array, n, lowest);
                        break;
                    case BUBBLE:
                        bubbleSort(array, n);
                        break;
                    case INSERTION:
                        insertionSort(array, n, current);
                        break;
                    default:
                        selectionSort(array, n, lowest);
                        break;
                }
                n++;
            }
        }
        else {
            lowest = 0;
            current = 0;
            verify(array, verified);
        };
        drawGraph(array, n, lowest, current, verified, window);
    }

    // ----------------------------------------------------------------------------------------------------------------

    CloseWindow();

    return 0;
}