From f19fbeb60b95d923cdfee1313662aa214e5e7f9e Mon Sep 17 00:00:00 2001 From: Jan Keim Date: Sun, 14 Aug 2016 01:51:43 +0200 Subject: [PATCH] README updated #2 --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4657451..65a3c2c 100644 --- a/README.md +++ b/README.md @@ -21,7 +21,7 @@ Recommended sorting variant of these three. Is fast and benefits well from paral Best way is to use cmake with the [Code](Code/) folder as source folder. Use a 64-Bit compiler as otherwise bigger array sizes won't work. ## Measurements -All measurements with randomly generated arrays of the given size. Times are in milliseconds. +All measurements with randomly generated arrays of the given size. Times are in milliseconds. The CPU variant for comparison is a self written mergesort implementation that generally runs faster than std::sort. Size | CPU | Mergesort | | SSN | | bitonic | Mergesort ---------------: | -------: | ---------------: | ----------: | ---------: | ----------: | -----------: | --------: