From f4e3907f2ce7f03eea3abb4a239aa2c5a4f83e88 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Thu, 23 Aug 2018 11:46:10 +0300 Subject: [PATCH] Add short Big O explanation to the main README. --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index d5fbe08d..a7ad2c5d 100644 --- a/README.md +++ b/README.md @@ -241,7 +241,9 @@ npm test -- 'playground' ### Big O Notation -Order of growth of algorithms specified in Big O notation. +*Big O notation* is used to classify algorithms according to how their running time or space requirements grow as the input size grows. + +On the chart below you may find most common orders of growth of algorithms specified in Big O notation. ![Big O graphs](./assets/big-o-graph.png)