Sort benchmarks

2 files changed, 54 insertions, 0 deletions

diff --git a/sort-benchmark/integers/sort.c b/sort-benchmark/integers/sort.c
new file mode 100644
index 0000000..2a23d9d
--- /dev/null
+++ b/sort-benchmark/integers/sort.c
@@ -0,0 +1,29 @@
+#define _POSIX_C_SOURCE 200809L /* Required to use clock_gettime */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+int a[ARRAYSIZE];
+
+int compar(const void *x, const void *y) { return *(int *)x - *(int *)y; }
+
+int main() {
+        srand(time(NULL));
+        for (int i = 0; i < ARRAYSIZE; i++) a[i] = rand() % 1000000000;
+
+        struct timespec begin;
+        clock_gettime(CLOCK_MONOTONIC, &begin);
+
+        qsort(a, ARRAYSIZE, sizeof(int), compar);
+
+        struct timespec end;
+        clock_gettime(CLOCK_MONOTONIC, &end);
+        double time = end.tv_sec - begin.tv_sec +
+                (end.tv_nsec - begin.tv_nsec) / 1000000000.0;
+
+        printf("(%d) C time for %d numbers: %lfs\n",
+                a[ARRAYSIZE/2], ARRAYSIZE, time);
+
+        return 0;
+}
diff --git a/sort-benchmark/integers/sort.cpp b/sort-benchmark/integers/sort.cpp
new file mode 100644
index 0000000..3434d7f
--- /dev/null
+++ b/sort-benchmark/integers/sort.cpp
@@ -0,0 +1,25 @@
+#include <algorithm>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+
+int a[ARRAYSIZE];
+
+int main(void) {
+        srand(time(NULL));
+        for (auto &x : a) x = rand() % 1000000000;
+
+        struct timespec begin;
+        clock_gettime(CLOCK_MONOTONIC, &begin);
+
+        std::sort(a, a+ARRAYSIZE,
+                [](const int &x, const int &y) { return x < y; });
+
+        struct timespec end;
+        clock_gettime(CLOCK_MONOTONIC, &end);
+        double time = end.tv_sec - begin.tv_sec +
+                (end.tv_nsec - begin.tv_nsec) / 1000000000.0;
+
+        std::cout << "(" << a[ARRAYSIZE/2] << ") C++ time for " << ARRAYSIZE
+                << " numbers: " << time << "s\n";
+}