Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f4e3907

Browse files
committed
Add short Big O explanation to the main README.
1 parent 5adca66 commit f4e3907

File tree

1 file changed

+3
-1
lines changed

1 file changed

+3
-1
lines changed

‎README.md‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -241,7 +241,9 @@ npm test -- 'playground'
241241

242242
### Big O Notation
243243

244-
Order of growth of algorithms specified in Big O notation.
244+
*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.
245247

246248
![Big O graphs](./assets/big-o-graph.png)
247249

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /