mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2025-07-07 01:44:52 +08:00
Add short Big O explanation to the main README.
This commit is contained in:
@ -242,7 +242,6 @@ npm test -- 'playground'
|
|||||||
### Big O Notation
|
### 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.
|
*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.
|
On the chart below you may find most common orders of growth of algorithms specified in Big O notation.
|
||||||
|
|
||||||

|

|
||||||
|
Reference in New Issue
Block a user