From debbd4efac5cea9b71468d36f7f11ab9b25837b9 Mon Sep 17 00:00:00 2001
From: Tyge Løvset <60263450+tylov@users.noreply.github.com>
Date: Thu, 11 Feb 2021 12:50:02 +0100
Subject: Update README.md

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 59a31fad..75f3c717 100644
--- a/README.md
+++ b/README.md
@@ -41,8 +41,8 @@ This shows that the STC containers performs either equal or better than the c++
 have been optimized for decades). **cmap** with default hash key is almost 3 times faster than *std::unordered_map*
 on insert and erase, and has orders of magnitude faster iteration and destruction. Additionally, **csmap** is notable
 faster on lookup than *std::map*'s typical red-black tree implementation. *csmap* uses an AA-tree (Arne Andersson, 1993),
-which tends to create a flatter structure (more balanced) than red-black trees. Be aware of though, both *std::map* and
-*csmap* are more than an order of magnitude slower than the unordered map implementations (n is 20 times smaller in the benchmarks).
+which tends to create a flatter structure (more balanced) than red-black trees. Be aware of though, both *csmap* and 
+*std::map* and are much slower than the unordered map implementations (`n` is half in the benchmarks).
 
 Highlights
 ----------
-- 
cgit v1.2.3