Add first quicksort

Author: kullingk

CMakeLists.txt

@@ -77,6 +77,7 @@ SET ( cppcore_common_src
     include/cppcore/Common/Hash.h
     include/cppcore/Common/TStringBase.h
     include/cppcore/Common/Variant.h
+    include/cppcore/Common/Sort.h
     include/cppcore/Common/TBitField.h
     include/cppcore/Common/TOptional.h
 )
@@ -133,6 +134,7 @@ IF( CPPCORE_BUILD_UNITTESTS )
     SET( cppcore_common_test_src
         test/common/HashTest.cpp
         test/common/VariantTest.cpp
+        test/common/SortTest.cpp
         test/common/TBitFieldTest.cpp
         test/common/TOptionalTest.cpp
     )

include/cppcore/Common/Sort.h

@@ -0,0 +1,73 @@
+#pragma once
+
+#include <cppcore/CPPCoreCommon.h>
+
+namespace cppcore {
+
+    typedef int32_t (*ComparisonFn)(const void* _lhs, const void* _rhs);
+
+    int32_t int_comp(const void *lhs, const void *rhs)  {
+        int32_t _lhs=0, _rhs=0;
+        memcpy(&_lhs, lhs, sizeof(int32_t));
+        memcpy(&_rhs, rhs, sizeof(int32_t));
+        if (_lhs > _rhs) {
+            return 1;
+        } else if (lhs == rhs) {
+            return 0;
+        }
+        return -1;
+    }
+
+    template<class T>
+    void swap(T *v1, T *v2) {
+        T tmp = *v1;
+        *v1 = *v2;
+        *v2 = *tmp;
+    }
+
+    inline void quicksort(void *pivot, void *_data, size_t num, ComparisonFn func=int_comp) {
+        if (num < 2) {
+            return;
+        }
+
+        if (_data == nullptr) {
+            return;
+        }
+
+        size_t l = 0;
+        size_t g = 1;
+        uint8_t *data = (uint8_t*) _data;
+        for (size_t i=1; i<num;) {
+            int32_t result = func(&data[i], pivot);
+            if (result > 0) {
+                swap(&data[l], &data[i]);
+                ++l;
+            } else if (result == 0) {
+                swap(&data[g], &data[i]);
+                ++g;
+                ++i;
+            } else  {
+                ++i;
+            }
+        }
+        
+        quicksort(pivot, &data[0], l, func);
+        quicksort(pivot, &data[g], num-g, func);
+    }
+
+    bool isSorted(void *data, size_t num, ComparisonFn func) {
+        if (num  < 2) {
+            return true;
+        }
+
+        for (size_t i=0; i<num-1; ++i) {
+            const int32_t result = func(&data[i], &data[i+1]);
+            if (result == -1) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+} // namespace cppcore

test/common/SortTest.cpp

@@ -0,0 +1,43 @@
+/*
+-------------------------------------------------------------------------------------------------
+The MIT License (MIT)
+
+Copyright (c) 2014-2024 Kim Kulling
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+-------------------------------------------------------------------------------------------------
+*/
+#include <cppcore/Common/Sort.h>
+
+#include "gtest/gtest.h"
+
+using namespace cppcore;
+
+class SortTest : public testing::Test {
+public:
+    
+protected:
+    // empty
+};
+
+TEST_F(SortTest, isSortedTest ) {
+    int32_t arr[] = {1,2,3,4,5};
+    bool sorted = isSorted(arr, 5, int_comp);
+    EXPECT_TRUE(sorted);
+}
+