added tests

Author: sethcg

.gitignore

@@ -1,2 +1,5 @@
 # BUILD FOLDER
-/build
+/build
+
+# LINE COUNT FILE
+line-count.txt

README.md

@@ -35,16 +35,16 @@ ctest --preset default
 ```bash
 
 # GET LINE COUNT (REQUIRES CLOC TO BE INSTALLED)
-cloc --include-lang=C++,"C/C++ Header",CMake --exclude-dir=build,vcpkg .
+cloc --include-lang=C++,"C/C++ Header",CMake --exclude-dir=build,vcpkg --out=line-count.txt .
 
 ```
 
 | Language         | Files | Blank | Comment | Code |
 |:-----------------|:-----:|:-----:|:-------:|:----:|
-| **C++**          | 15    | 287   | 150     | 890  |
-| **C/C++ Header** | 11    | 80    | 1       | 156  |
+| **C++**          | 17    | 336   | 182     | 1018 |
+| **C/C++ Header** | 12    | 92    | 1       | 171  |
 | **CMake**        | 4     | 24    | 19      | 63   |
 |                                                   |
-| **Total**        | 30    | 391   | 170     | 1109 |
+| **Total**        | 33    | 452   | 202     | 1252 |
 
 </details>

core/include/sorts/QuickSort.hpp

@@ -8,15 +8,15 @@
 
 namespace QuickSort {
 
-    rgb_color GetRectangleColor(bool isPivot, bool isSelected);
+    rgb_color GetRectangleColor(bool isOrdered, bool isPivot, bool isSelected);
 
     int GetPartitionCount(Rectangle* array, int low, int high, int* stepCount);
 
     void GetQuickSortCount(Rectangle* array, int low, int high, int* stepCount);
 
     int GetStepCount(Rectangle* items);
 
-    int Partition(Rectangle* array, int low, int high);
+    int Partition(Rectangle* array, int low, int high, int* currentStep, SortSequence sort);
 
     void QuickSort(Rectangle* array, int low, int high, int* currentStep, SortSequence sort);
 

test/sorts/QuickSort.cc

@@ -0,0 +1,47 @@
+#include <gtest/gtest.h>
+#include <SDL3/SDL.h>
+
+#include <TestUtils.hpp>
+
+#include <QuickSort.hpp>
+#include <List.hpp>
+#include <Rect.hpp>
+
+using namespace QuickSort;
+
+TEST(QuickSort_Test, GetStepCount_GreaterThanOne) {
+    // ARRANGE
+    SDL_Renderer* renderer = (SDL_Renderer*) malloc(sizeof(Rectangle));
+    Rectangle* items = (Rectangle*) malloc(LIST_SIZE * sizeof(Rectangle));
+
+    CreateList(renderer, items, WINDOW_WIDTH, WINDOW_HEIGHT);
+    ShuffleList(items);
+
+    // ACT
+    int stepCount = GetStepCount(items);
+
+    // ASSERT
+    EXPECT_TRUE(stepCount > 1);
+}
+
+TEST(QuickSort_Test, GetSequence_CorrectOrder) {
+    // ARRANGE
+    SDL_Renderer* renderer = (SDL_Renderer*) malloc(sizeof(Rectangle));
+    Rectangle* items = (Rectangle*) malloc(LIST_SIZE * sizeof(Rectangle));
+
+    CreateList(renderer, items, WINDOW_WIDTH, WINDOW_HEIGHT);
+    ShuffleList(items);
+
+    // ACT
+    SortSequence sequence = GetSequence(items);
+
+    // ASSERT
+    EXPECT_TRUE(sequence.stepCount > 0);
+
+    int lastStep = sequence.stepCount - 1;
+    int offset;
+    for (int i = 0; i < LIST_SIZE; i++) {
+        offset = (lastStep * LIST_SIZE) + i;
+        EXPECT_EQ(sequence.steps[offset].value, (i + 1));
+    }
+}