Skip to content

Commit

Permalink
README updated #2
Browse files Browse the repository at this point in the history
  • Loading branch information
Jan Keim committed Aug 13, 2016
1 parent 6b065c6 commit f19fbeb
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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
---------------: | -------: | ---------------: | ----------: | ---------: | ----------: | -----------: | --------:
Expand Down

0 comments on commit f19fbeb

Please sign in to comment.