Sorting-Algorithm-Visualizer/insertion.hpp at main · JackFromSchool/Sorting-Algorithm-Visualizer · 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
81
82
83
84
85
86
#include "raylib.h"
#include <array>

void insertionSort(const int WINDOW_WIDTH, const int WINDOW_HEIGHT, std::array<int, 100>& mainArray) {
   int step = 1;
   int stepBack = 1;
   bool sorted = false;

   const int BAR_WIDTH = WINDOW_WIDTH/mainArray.size();
   const int BAR_HEIGHT = WINDOW_HEIGHT/mainArray.size();

   while(!WindowShouldClose()) {

   BeginDrawing();

   ClearBackground(BLACK);

   if(!sorted) {
   for(int i = 0; i < mainArray.size(); i++) {
      if(step == i || stepBack == i) {
            DrawRectangle(i*BAR_WIDTH, WINDOW_HEIGHT-mainArray[i]*BAR_HEIGHT, BAR_WIDTH-1, mainArray[i]*BAR_HEIGHT, RED);
      } else {
            DrawRectangle(i*BAR_WIDTH, WINDOW_HEIGHT-mainArray[i]*BAR_HEIGHT, BAR_WIDTH-1, mainArray[i]*BAR_HEIGHT, WHITE);
      }
   }

   if(stepBack > 0) {
      if(mainArray[stepBack-1] > mainArray[stepBack] && step != mainArray.size()) {
         int swap = mainArray[stepBack];
         mainArray[stepBack] = mainArray[stepBack-1];
         mainArray[stepBack-1] = swap;
         stepBack--;
      } else {
         step++;
         stepBack = step;
      }
   } else {
      step++;
      stepBack = step;
   }

   if(step == mainArray.size()) {
      sorted = true;
      step = 0;
   }

   } else {
      for(int i = 0; i < mainArray.size(); i++) {
            if(step == i) {
               DrawRectangle(i*BAR_WIDTH, WINDOW_HEIGHT-mainArray[i]*BAR_HEIGHT, BAR_WIDTH-1, mainArray[i]*BAR_HEIGHT, RED);
            } else if (step > i) {
               DrawRectangle(i*BAR_WIDTH, WINDOW_HEIGHT-mainArray[i]*BAR_HEIGHT, BAR_WIDTH-1, mainArray[i]*BAR_HEIGHT, GREEN);
            } else {
               DrawRectangle(i*BAR_WIDTH, WINDOW_HEIGHT-mainArray[i]*BAR_HEIGHT, BAR_WIDTH-1, mainArray[i]*BAR_HEIGHT, WHITE);
            }
      }

      // Fake checking to see if the array is sorted cause I know it is
      if(step != mainArray.size()-1) {
            step++;
      }

   }

   EndDrawing();

   }

   mainArray.fill(0);
   srand(time(NULL));
   int temp;
   bool valid = false;
   for(int i = 0; i < mainArray.size(); i++) {
      do {
         temp = (rand()%mainArray.size())+1;
         valid = true;
         for(int i = 0; i < mainArray.size(); i++) {
            if(temp == mainArray[i]) {
               valid = false;
            }
         }
      } while(!valid);
      mainArray[i] = temp;
      valid = false;
   }
}