From 4d752627f27c48fb03ee7f343193254bce11e123 Mon Sep 17 00:00:00 2001
From: karl <karl.bittner@hexaquo.at>
Date: Tue, 20 Oct 2020 10:43:44 +0200
Subject: [PATCH] Add complexity text to README

---
 README.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index cd8bc46..d2bb051 100644
--- a/README.md
+++ b/README.md
@@ -43,4 +43,8 @@ vector median of medians + quickselect (exact)  :    22.3934ms
 vector median of medians only (approximative)   :    11.3237ms
 wirth kth element                               :     8.5368ms
 --------------------
-```
\ No newline at end of file
+```
+
+## Complexity
+
+The algorithms which fully sort the array (quicksort median, array quicksort, array std sort) have an average complexity of O(N logN). All 'proper' median algorithms (randomized select, vector median of medians, wirth kth element, nth element) have an average complexity of O(N). The difference is well visible in the results above.