insertion sort fix

This commit is contained in:
2025-12-19 08:15:28 +05:00
parent bdbe959e23
commit 7dc80c2fdf

View File

@@ -5,11 +5,12 @@
#define insertionSort_inline(arr, n, field) \ #define insertionSort_inline(arr, n, field) \
for(i32 i = 1, j; i < (i32)n; i++) { \ for(i32 i = 1, j; i < (i32)n; i++) { \
j = i; \ j = i; \
while( j > 0 && arr[j - 1]field > arr[i]field){\ typeof(arr[i]) t = arr[i];\
while(j > 0 && arr[j - 1]field > t##field){\
arr[j] = arr[j - 1]; \ arr[j] = arr[j - 1]; \
j--; \ j--; \
} \ } \
arr[j] = arr[i]; \ arr[j] = t; \
} \ } \
#define binarySearch_inline(arr, n, key, field, out_index) {\ #define binarySearch_inline(arr, n, key, field, out_index) {\