aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2024-04-29 21:59:51 +0200
committerSebastiano Tronto <sebastiano@tronto.net>2024-04-29 21:59:51 +0200
commit2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565 (patch)
treebc3a8cea30ecca96ed7ed779a1a4149ef9baa068 /README.md
downloadtaming-cpp-2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565.tar.gz
taming-cpp-2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565.zip
Sort benchmarks
Diffstat (limited to 'README.md')
-rw-r--r--README.md19
1 files changed, 19 insertions, 0 deletions
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..17b7043
--- /dev/null
+++ b/README.md
@@ -0,0 +1,19 @@
1# Taming C++
2
3Experiments with C++ and comparisons with C.
4
5## sort-benchmark
6
7Inspired by [Bert's post](https://berthub.eu/articles/posts/c++-1).
8
9Sorting an array of integers is a simple task, so C and C++ should perform
10similarly, right? Wrong!
11
12```
13C time for 100000000 numbers: 9.886314s
14C++ time for 100000000 numbers: 4.92299s
15C++ time for 100000000 numbers (parallel): 0.495435s
16```
17
18A similar benchmark is provided for sorting an arrays of pairs in a
19non-standard way.

Generated with cgit - Back to sebastiano.tronto.net