qsort sorts according to system endianness

libkeke_array.c

@@ -186,8 +186,18 @@ void *keke_array_find_start(KekeArray *array, void *start, size_t size) {
 }
 
 int compar(const void *a, const void *b, void *size_v) {
-	size_t *size = size_v;
-	return memcmp(a, b, *size);
+	size_t size = *(size_t *) size_v;
+#if defined(__BYTE_ORDER__)&&(__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
+	return memcmp(a, b, size);
+#else
+	const unsigned char *aa = a;
+	const unsigned char *bb = b;
+	for(size_t i = 0; i < size; ++i) {
+		size_t s = size - i - 1;
+		if(aa[s] != bb[s]) return aa[s] - bb[s];
+	}
+	return 0;
+#endif
 }
 
 void keke_array_qsort(KekeArray *array) {