optimized c

Author: Pl4tt

c/sortingAlgorithms/quicksort.c

@@ -4,20 +4,20 @@ void swap(int *x, int *y) {
     *y = temp;
 }
 
-int partition(int array[], int low, int high) {
-    int pivot = array[high];
-    int i = (low - 1);
+int partition(int arr[], int low, int high) {
+    int pivot = arr[high];
+    int l = (low - 1);
 
     for (int pos = low; pos < high; pos++) {
-        if (array[pos] <= pivot) {
-            i++;
-            swap(&array[i], &array[pos]);
+        if (arr[pos] <= pivot) {
+            l++;
+            swap(&arr[l], &arr[pos]);
         }
     }
 
-    swap(&array[i + 1], &array[high]);
+    swap(&arr[l+1], &arr[high]);
 
-    return (i + 1);
+    return (l + 1);
 }
 
 void quicksort(int arr[], int low, int high) {

c/sortingAlgorithms/testing.c

@@ -1,4 +1,5 @@
 #include <stdio.h>
+#include <stdbool.h>
 
 #include "quicksort.c"
 
@@ -7,16 +8,27 @@ void printArray(int arr[], int size) {
     for (int i = 0; i < size; i++) {
         printf("%d ", arr[i]);
     }
-    printf("end");
+    printf("end\n");
+}
+
+bool equalArrays(int arr[], int arr2[], int size) {
+    for (int i = 0; i < size; i++) {
+        if (arr[i] != arr2[i]) return false;
+    }
+
+    return true;
 }
 
 int main()
 {
     int arr[] = {21561, 9, -124714, 0, -1247, 24171, 21742174, 47421, -7285, 261, 2, 521, 10, 3, 216, 7, 6216, 2, 62161, 7, 68, 9, -83148, -1235, 1, -10, 166, 389, 13, 63, 19361, 32, 7317, 8539, 32732, 24151621, -2, 7327, 2157105, 1235, 852, 121, 21, -100, -124, 23, 742, 7654, 87, 123456, 6543, 21261, 48245, 16, 8765, 987654321, 247, 125, 8421, 942, 532, 913, 126, 274, 135, 100000, 2162, 37272};
+    int sol[] = {-124714, -83148, -7285, -1247, -1235, -124, -100, -10, -2, 0, 1, 2, 2, 3, 7, 7, 9, 9, 10, 13, 16, 21, 23, 32, 63, 68, 87, 121, 125, 126, 135, 166, 216, 247, 261, 274, 389, 521, 532, 742, 852, 913, 942, 1235, 2162, 6216, 6543, 7317, 7327, 7654, 8421, 8539, 8765, 19361, 21261, 21561, 24171, 32732, 37272, 47421, 48245, 62161, 100000, 123456, 2157105, 21742174, 24151621, 987654321};
     int length = sizeof(arr) / sizeof(int);
 
-    quicksort(arr, 0, length);
+    quicksort(arr, 0, length-1);
     printArray(arr, length);
 
+    printf("%s", equalArrays(arr, sol, length) ? "true" : "false");
+
     return 0;
 }

python/sorting_algorithms/testing.py

@@ -11,7 +11,7 @@
     difficult_sort_test2 = [21561, 9, -124714, 0, -1247, 24171, 21742174, 47421, -7285, 261, 2, 521, 10, 3, 216, 7, 6216, 2, 62161, 7, 68, 9, -83148, -1235, 1, -10, 166, 389, 13, 63, 19361, 32, 7317, 8539, 32732, 24151621, -2, 7327, 2157105, 1235, 852, 121, 21, -100, -124, 23, 742, 7654, 87, 123456, 6543, 21261, 48245, 16, 8765, 987654321, 247, 125, 8421, 942, 532, 913, 126, 274, 135, 100000, 2162, 37272]
 
     difficult_non_negative_sort_test = [5312, 621, 7, 47, 1, 34, 7, 3146134, 416, 21, 641, 3512, 6325, 64174, 326, 3416, 417, 3164, 3421653, 731, 1431, 43181346, 631280]
-
+    print(sorted(difficult_sort_test2))
     print(bubble_sort(difficult_sort_test) == merge_sort(difficult_sort_test) == quicksort(difficult_sort_test2) == sorted(difficult_sort_test2))
 
     print(bubble_sort(difficult_sort_test) == sorted(difficult_sort_test2))