aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2024-12-26 12:19:10 +0100
committerSebastiano Tronto <sebastiano@tronto.net>2024-12-26 12:19:10 +0100
commit05b8b7d3239bc53955a8ec8e7d9991224c0fd917 (patch)
tree7056e26d635cefa7341b6cda9af3e8061f7e708b /README.md
parentc5bedb79e7c808294e85ed6fbba9aae527cd2990 (diff)
downloadtaming-cpp-05b8b7d3239bc53955a8ec8e7d9991224c0fd917.tar.gz
taming-cpp-05b8b7d3239bc53955a8ec8e7d9991224c0fd917.zip
Added RAII
Diffstat (limited to 'README.md')
-rw-r--r--README.md7
1 files changed, 7 insertions, 0 deletions
diff --git a/README.md b/README.md
index 17b7043..3404c3e 100644
--- a/README.md
+++ b/README.md
@@ -4,6 +4,9 @@ Experiments with C++ and comparisons with C.
4 4
5## sort-benchmark 5## sort-benchmark
6 6
7For the
8[first post in the series](https://sebastiano.tronto.net/blog/2024-04-30-taming-cpp-motivation/).
9
7Inspired by [Bert's post](https://berthub.eu/articles/posts/c++-1). 10Inspired by [Bert's post](https://berthub.eu/articles/posts/c++-1).
8 11
9Sorting an array of integers is a simple task, so C and C++ should perform 12Sorting an array of integers is a simple task, so C and C++ should perform
@@ -17,3 +20,7 @@ C++ time for 100000000 numbers (parallel): 0.495435s
17 20
18A similar benchmark is provided for sorting an arrays of pairs in a 21A similar benchmark is provided for sorting an arrays of pairs in a
19non-standard way. 22non-standard way.
23
24## raii
25
26Various small examples on constructors, destructors and related things.

Generated with cgit - Back to sebastiano.tronto.net