From 945052d495f38371bceed66cc3ed9ae66c7bd651 Mon Sep 17 00:00:00 2001
From: Tyge Løvset <60263450+tylov@users.noreply.github.com>
Date: Sun, 21 Jun 2020 23:26:54 +0200
Subject: Update README.md

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

diff --git a/README.md b/README.md
index 773ce7b8..26438388 100644
--- a/README.md
+++ b/README.md
@@ -94,10 +94,10 @@ The containers are memory efficent. E.g. the circular list is intrusive so only
 - **CHash set**: Representation: 4 pointers size. The hash table stores a key per bucket, and one table of "used/hash-value", occupying only one byte per bucket.
 - **CHash map**: Same as CHash set, but each bucket in the array stores a (key, value) pair, not only the key.
 
-Examples
---------
+Demos
+-----
 
-**CString** demo
+**CString**
 ```
 #include <stc/cstring.h>
 
@@ -232,7 +232,7 @@ int main() {
         clist_i_destroy(&list);
     }
 ```
-**CArray** demo
+**CArray**
 ```
 #include <stc/carray.h>
 declare_CArray(f, float);
-- 
cgit v1.2.3