jeena/en.javascript.info
1
0
Fork 0
Code Issues Pull requests Projects Packages Wiki Activity Actions

Fix typo.

Browse source
This commit is contained in:
Osvaldo Dias dos Santos 2020-12-05 00:04:46 +01:00
parent e1a3f634a4
commit 268159c139
2 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

2
1-js/05-data-types/04-array/10-maximal-subarray/solution.md
View file

@ -57,7 +57,7 @@ alert( getMaxSubSum([1, 2, 3]) ); // 6
alert( getMaxSubSum([100, -9, 2, -3, 5]) ); // 100
```
The solution has a time complexety of [O(n<sup>2</sup>)](https://en.wikipedia.org/wiki/Big_O_notation). In other words, if we increase the array size 2 times, the algorithm will work 4 times longer.
The solution has a time complexity of [O(n<sup>2</sup>)](https://en.wikipedia.org/wiki/Big_O_notation). In other words, if we increase the array size 2 times, the algorithm will work 4 times longer.
For big arrays (1000, 10000 or more items) such algorithms can lead to a serious sluggishness.