From 872a38fac6ee2d8df7adac9dbab625e5965cf4cc Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Thu, 23 Aug 2018 11:47:19 +0300 Subject: [PATCH] Add short Big O explanation to the main README. --- README.md | 1 - 1 file changed, 1 deletion(-) diff --git a/README.md b/README.md index a7ad2c5d..915b3fb3 100644 --- a/README.md +++ b/README.md @@ -242,7 +242,6 @@ npm test -- 'playground' ### 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)