Implement MISRA compliant quick sort

- MISRA compliant quick sort

Author: jciberlin

Inc/sort/quick_sort.h

@@ -0,0 +1,61 @@
+/****************************************************************************
+ *
+ *   Copyright (c) 2025 IMProject Development Team. All rights reserved.
+ *   Authors: Juraj Ciberlin <[email protected]>
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ * 3. Neither the name IMProject nor the names of its contributors may be
+ *    used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+ * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
+ * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
+ * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ ****************************************************************************/
+
+#ifndef UTILITY_QUICK_SORT_H_
+#define UTILITY_QUICK_SORT_H_
+
+#include "typedefs.h"
+
+#define MAX_NUM_OF_ELEMENTS (64)
+
+/**
+ * @brief Sort elements using quick sort algorithm. Quick sort algorithm works on divide and conquer
+ * principle. Firstly, it selects an element from an array as a pivot. Secondly, partitioning is done
+ * (array is arranged around the pivot). Elements smaller than the pivot will be on the left side,
+ * elements that are greater than the pivot will be on the right side. Pivot will be in the correct
+ * position. Repeat the process until the initial array is not sorted. This algorithm does not use
+ * recursion since it is not MISRA compliant.
+ * Time complexity: O(N log N)
+ *
+ * @param[in/out] *buffer Pointer to the buffer that contains elements that will be sorted.
+ * @param[in] number_of_elements Number of elements in the buffer.
+ * @param[in] element_size Size of the element, in bytes.
+ * @param[in] *compareFun Pointer to compare function. Compare function has two parameters (pointer to
+ *                        first element and pointer to second element). As a result, it returns boolean,
+ *                        true if first element is greater than second element, otherwise false.
+ */
+void QuickSort_sort(byte_t* buffer, int32_t number_of_elements, int32_t element_size,
+                    bool (*compareFun)(void* first, void* second));
+
+#endif /* UTILITY_QUICK_SORT_H_ */

Makefile

@@ -112,6 +112,7 @@ IMUTILITY_FILES=\
   Src/sort/heap_sort.c \
   Src/sort/insertion_sort.c \
   Src/sort/merge_sort.c \
+  Src/sort/quick_sort.c \
   Src/sort/selection_sort.c \
   Src/json.c \
   Src/map.c \
@@ -140,6 +141,7 @@ SRC_FILES+=$(IMUTILITY_FILES) \
   Tests/test_merge_sort.c \
   Tests/test_priority_queue.c \
   Tests/test_queue.c \
+  Tests/test_quick_sort.c \
   Tests/test_scheduler.c \
   Tests/test_selection_sort.c \
   Tests/test_utils.c \

README.md

@@ -151,6 +151,7 @@ Join us on the Discord channel https://discord.gg/R6nZxZqDH3
 - HeapSort_sort
 - InsertionSort_sort
 - MergeSort_sort
+- QuickSort_sort
 - SelectionSort_sort
 
 ### Utils

Src/sort/quick_sort.c

@@ -0,0 +1,85 @@
+/****************************************************************************
+ *
+ *   Copyright (c) 2025 IMProject Development Team. All rights reserved.
+ *   Authors: Juraj Ciberlin <[email protected]>
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ * 3. Neither the name IMProject nor the names of its contributors may be
+ *    used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+ * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
+ * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
+ * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ ****************************************************************************/
+
+#include "quick_sort.h"
+
+#include "utils.h"
+
+static int32_t
+Partition(byte_t* buffer, int32_t start_index, int32_t end_index, int32_t element_size, bool (*compareFun)(void* first,
+          void* second)) {
+    int32_t pivot_pos = start_index - 1;
+
+    for (int32_t i = start_index; i <= (end_index - 1); ++i) {
+        bool compare = compareFun(&buffer[end_index * element_size], &buffer[i * element_size]);
+        if (compare) {
+            ++pivot_pos;
+            Utils_swapElements(&buffer[pivot_pos * element_size], &buffer[i * element_size], (uint32_t)element_size);
+        }
+    }
+    Utils_swapElements(&buffer[(pivot_pos + 1) * element_size], &buffer[end_index * element_size], (uint32_t)element_size);
+    ++pivot_pos;
+    return pivot_pos;
+}
+
+void
+QuickSort_sort(byte_t* buffer, int32_t number_of_elements, int32_t element_size,
+               bool (*compareFun)(void* first, void* second)) {
+    int32_t indexes[MAX_NUM_OF_ELEMENTS] = {0, number_of_elements - 1};
+
+    int32_t top = 1;
+
+    while (top >= 0) {
+        int32_t end_index = indexes[top];
+        --top;
+        int32_t start_index = indexes[top];
+        --top;
+
+        int32_t pivot_index = Partition(buffer, start_index, end_index, element_size, compareFun);
+
+        if ((pivot_index - 1) > start_index) {
+            ++top;
+            indexes[top] = start_index;
+            ++top;
+            indexes[top] = pivot_index - 1;
+        }
+
+        if ((pivot_index + 1) < end_index) {
+            ++top;
+            indexes[top] = pivot_index + 1;
+            ++top;
+            indexes[top] = end_index;
+        }
+    }
+}

Tests/test_main.c

@@ -18,6 +18,7 @@ RunAllTests(void) {
     RUN_TEST_GROUP(MergeSort);
     RUN_TEST_GROUP(PriorityQueue);
     RUN_TEST_GROUP(Queue);
+    RUN_TEST_GROUP(QuickSort);
     RUN_TEST_GROUP(Scheduler);
     RUN_TEST_GROUP(SelectionSort);
     RUN_TEST_GROUP(Utils);

Tests/test_quick_sort.c

@@ -0,0 +1,53 @@
+#include "quick_sort.h"
+
+#include "unity.h"
+#include "unity_fixture.h"
+
+#include "helper/sort_functions.h"
+
+TEST_GROUP(QuickSort);
+
+TEST_SETUP(QuickSort) {
+}
+
+TEST_TEAR_DOWN(QuickSort) {
+}
+
+TEST_GROUP_RUNNER(QuickSort) {
+    RUN_TEST_CASE(QuickSort, QuickSort_int32);
+    RUN_TEST_CASE(QuickSort, QuickSort_float64);
+    RUN_TEST_CASE(QuickSort, QuickSort_uint64);
+}
+
+TEST(QuickSort, QuickSort_int32) {
+    int32_t unsorted_array[] = {5, 2, 3, 1000000, 9, 10, 11, 8, 9, 100};
+    const int32_t sorted_array[] = {2, 3, 5, 8, 9, 9, 10, 11, 100, 1000000};
+    QuickSort_sort((byte_t*)unsorted_array, sizeof(unsorted_array) / sizeof(unsorted_array[0]), sizeof(unsorted_array[0]),
+                   CompareInt32);
+
+    for (uint32_t i = 0U; i < (sizeof(unsorted_array) / sizeof(unsorted_array[0])); ++i) {
+        TEST_ASSERT_EQUAL_INT32(sorted_array[i], unsorted_array[i]);
+    }
+}
+
+TEST(QuickSort, QuickSort_float64) {
+    float64_t unsorted_array[] = {5.8, 2.2, 3.1, 1.1, 9.1, 10.3, 11.2, 8.4, 9.2, 100.9};
+    const float64_t sorted_array[] = {1.1, 2.2, 3.1, 5.8, 8.4, 9.1, 9.2, 10.3, 11.2, 100.9};
+    QuickSort_sort((byte_t*)unsorted_array, sizeof(unsorted_array) / sizeof(unsorted_array[0]), sizeof(unsorted_array[0]),
+                   CompareFloat64);
+
+    for (uint32_t i = 0U; i < (sizeof(unsorted_array) / sizeof(unsorted_array[0])); ++i) {
+        TEST_ASSERT_EQUAL_DOUBLE(sorted_array[i], unsorted_array[i]);
+    }
+}
+
+TEST(QuickSort, QuickSort_uint64) {
+    uint64_t unsorted_array[] = {1111111U, 55555555U, 44444U, 10000000000000U, 212121U, 1111U, 1U, 2U, 5U, 3U};
+    const uint64_t sorted_array[] = {1U, 2U, 3U, 5U, 1111U, 44444U, 212121U, 1111111U, 55555555U, 10000000000000U};
+    QuickSort_sort((byte_t*)unsorted_array, sizeof(unsorted_array) / sizeof(unsorted_array[0]), sizeof(unsorted_array[0]),
+                   CompareUint64);
+
+    for (uint32_t i = 0U; i < (sizeof(unsorted_array) / sizeof(unsorted_array[0])); ++i) {
+        TEST_ASSERT_EQUAL_UINT64(sorted_array[i], unsorted_array[i]);
+    }
+}