hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge db0ec03087 into ca3d16dcce

Browse Source
This commit is contained in:
BradyBromley 2024-07-17 10:38:38 +09:00 committed by GitHub
commit dde6935ec4
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -44,7 +44,7 @@ only, and it is **not** meant to be used for production.*
## Data Structures ## Data Structures
A data structure is a particular way of organizing and storing data in a computer so that it can A data structure is a way of organizing and storing data in a computer so that the data can
be accessed and modified efficiently. More precisely, a data structure is a collection of data be accessed and modified efficiently. More precisely, a data structure is a collection of data
values, the relationships among them, and the functions or operations that can be applied to values, the relationships among them, and the functions or operations that can be applied to
the data. the data.
@ -190,7 +190,7 @@ a set of rules that precisely define a sequence of operations.
### Algorithms by Paradigm ### Algorithms by Paradigm
An algorithmic paradigm is a generic method or approach which underlies the design of a class An algorithmic paradigm is a generic method which underlies the design of a class
of algorithms. It is an abstraction higher than the notion of an algorithm, just as an of algorithms. It is an abstraction higher than the notion of an algorithm, just as an
algorithm is an abstraction higher than a computer program. algorithm is an abstraction higher than a computer program.
@ -317,7 +317,7 @@ 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 the most common orders of growth of algorithms are specified in Big O notation.
![Big O graphs](./assets/big-o-graph.png) ![Big O graphs](./assets/big-o-graph.png)