From b75504a4ff140cd9f747fa8fd174d61555d32dbb Mon Sep 17 00:00:00 2001
From: rhinemann <andreyfrog26@gmail.com>
Date: Fri, 27 Dec 2024 17:32:59 +0200
Subject: [PATCH] Tests passed.

---
 CMakeLists.txt |  5 ++--
 main.cpp       | 79 +++++++++++++++++++++++++++++++++++++++++++++++---
 sort.cpp       | 53 ++++++++++++++++++++++++++++++---
 sort.h         |  8 ++---
 4 files changed, 130 insertions(+), 15 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index f2ace4c..6d26434 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -6,5 +6,6 @@ set(CMAKE_CXX_STANDARD 23)
 add_executable(code main.cpp
         sort.cpp
         sort.h
-        stringProcessor.cpp
-        stringProcessor.h)
+)
+
+target_link_libraries(code gtest gmock pthread)
diff --git a/main.cpp b/main.cpp
index f253cbe..43654df 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,6 +1,77 @@
-#include <iostream>
+#include "sort.h"
 
-int main() {
-    std::cout << "Hello, World!" << std::endl;
-    return 0;
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+TEST(QuickSortTest, SortsArrayInAscendingOrder)
+{
+    // Test input array
+    char* arr[] = { "banana", "apple", "cherry", "date", "elderberry" };
+    const size_t length = std::size(arr);
+
+    // Sort the array
+    quick_sort(arr, length);
+
+    // Check if the array is sorted in ascending order
+    for (size_t i = 1; i < length; i++)
+    {
+        ASSERT_TRUE(strcmp(arr[i - 1], arr[i]) <= 0);
+    }
+}
+
+TEST(QuickSortTest, SingleElementArray) {
+    // Test sorting an array with a single element.
+    char* arr[] = { "hello" };
+    quick_sort(arr, 1);
+    ASSERT_STREQ(arr[0], "hello");
+}
+
+TEST(QuickSortTest, SortedArray) {
+    // Test sorting an array that is already sorted.
+    char* arr[] = { "alpha", "beta", "gamma" };
+    quick_sort(arr, 3);
+    ASSERT_STREQ(arr[0], "alpha");
+    ASSERT_STREQ(arr[1], "beta");
+    ASSERT_STREQ(arr[2], "gamma");
+}
+
+TEST(QuickSortTest, ReverseSortedArray) {
+    // Test sorting an array that is reverse sorted.
+    char* arr[] = { "gamma", "beta", "alpha" };
+    quick_sort(arr, 3);
+    ASSERT_STREQ(arr[0], "alpha");
+    ASSERT_STREQ(arr[1], "beta");
+    ASSERT_STREQ(arr[2], "gamma");
+}
+
+TEST(QuickSortTest, RandomArray) {
+    // Test sorting an array with random elements.
+    char* arr[] = { "hello", "world", "foo", "bar", "baz", "qux", "quux", "corge" };
+    quick_sort(arr, 8);
+    ASSERT_STREQ(arr[0], "bar");
+    ASSERT_STREQ(arr[1], "baz");
+    ASSERT_STREQ(arr[2], "corge");
+    ASSERT_STREQ(arr[3], "foo");
+    ASSERT_STREQ(arr[4], "hello");
+    ASSERT_STREQ(arr[5], "quux");
+    ASSERT_STREQ(arr[6], "qux");
+    ASSERT_STREQ(arr[7], "world");
+}
+
+TEST(SwapTest, SwapsValuesCorrectly)
+{
+    char* a = "apple";
+    char* b = "banana";
+
+    swap(&a, &b);
+
+    EXPECT_STREQ(a, "banana");
+    EXPECT_STREQ(b, "apple");
+}
+
+int main(int argc, char **argv)
+{
+    ::testing::InitGoogleTest(&argc, argv);
+
+    return RUN_ALL_TESTS();
 }
\ No newline at end of file
diff --git a/sort.cpp b/sort.cpp
index 4229a4d..e613b71 100644
--- a/sort.cpp
+++ b/sort.cpp
@@ -1,5 +1,50 @@
-//
-// Created by rhinemann on 27.12.24.
-//
-
 #include "sort.h"
+
+#include <cstring>
+
+void swap(char **a, char **b) {
+    char *temp = *a;
+    *a = *b;
+    *b = temp;
+}
+
+int partition(char **arr, const int first, const int last)
+{
+    const char *pivot = arr[last];
+
+    int i = first;
+    for (int j = first; j < last; j++) {
+        if (strcmp(arr[j], pivot) <= 0) {
+            swap(&arr[i], &arr[j]);
+            i++;
+        }
+    }
+    swap(&arr[i], &arr[last]);
+    return (i);
+}
+
+void quick_sort(char **arr, const size_t length) {
+    if (length <= 1) {
+        return;
+    }
+    int low = 0, high = length - 1;
+    int stack[high - low + 1];
+    int top = -1;
+    stack[++top] = low;
+    stack[++top] = high;
+    while (top >= 0) {
+        high = stack[top--];
+        low = stack[top--];
+        const int pivot_pos = partition(arr, low, high);
+
+        if (pivot_pos - 1 > low) {
+            stack[++top] = low;
+            stack[++top] = pivot_pos - 1;
+        }
+
+        if (pivot_pos + 1 < high) {
+            stack[++top] = pivot_pos + 1;
+            stack[++top] = high;
+        }
+    }
+}
diff --git a/sort.h b/sort.h
index 934883c..2a6e896 100644
--- a/sort.h
+++ b/sort.h
@@ -1,8 +1,6 @@
-//
-// Created by rhinemann on 27.12.24.
-//
-
 #ifndef SORT_H
 #define SORT_H
-
+#include <cstddef>
+void swap(char** a, char** b);
+void quick_sort(char** arr, size_t length);
 #endif //SORT_H