8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5adca66 commit f4e3907Copy full SHA for f4e3907
README.md
@@ -241,7 +241,9 @@ npm test -- 'playground'
241
242
### Big O Notation
243
244
-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.
245
+
246
+On the chart below you may find most common orders of growth of algorithms specified in Big O notation.
247
248

249
0 commit comments