remove file

Author: vidsinghal

benchrunner/cxx/benchmarks.h

@@ -26,6 +26,7 @@ void *smergesort_cmp(void *const pbase, size_t total_elems, size_t size, __compa
 void *mergesort_par(void *const pbase, size_t total_elems, size_t size, __compar_fn_t cmp);
 void *cilksort(void *const pbase, size_t total_elems, size_t size, __compar_fn_t cmp);
 void *cilksort_par(void *const pbase, size_t total_elems, size_t size, __compar_fn_t cmp);
+template <typename T> T *bottomUpMergeSort(T *a, T *b, int n);
 
 // Microbenchmarks.
 int64_t* __attribute__ ((noinline)) fill_array_seq(size_t total_elems, int64_t val);

benchrunner/cxx/main.cpp

@@ -2,6 +2,7 @@
 #include "benchmarks.h"
 #include "insertionsort.cpp"
 #include "quicksort.cpp"
+#include "mergesort.cpp"
 #include "microbench.h"
 #include "cbench.h"
 #include <chrono>
@@ -38,5 +39,20 @@ int main(int argc, char *argv[]) {
 
     slice_assert_sorted_2(out, arr_size);
 
+    std::cout << std::endl;
+    std::cout << "Benchmarking mergesort sequential: " << std::endl;
+    for (size_t i = 0; i < iters; i++) {
+        int64_t *arr = fill_array_rand_seq(arr_size);
+        int64_t *copyOut = new int64_t[arr_size];
+        copyArray<int64_t>(arr, copyOut, arr_size);
+        start = std::chrono::system_clock::now();
+        out = bottomUpMergeSort<int64_t>(arr, copyOut, arr_size);
+        end = std::chrono::system_clock::now();
+        std::chrono::duration<double> elapsed_seconds = end - start;
+        printf("itertime: %lf\n", elapsed_seconds.count());
+    }
+
+    slice_assert_sorted_2(out, arr_size);
+
     return 0;
 }