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

Typo correction

Browse source 
"seroius" to "serious"
This commit is contained in:
Mojtaba Javan 2018-12-27 04:53:34 +03:30 • committed by GitHub
parent e62dfd5254
commit 20ee100c20
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 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

@ -59,7 +59,7 @@ 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.
For big arrays (1000, 10000 or more items) such algorithms can lead to a seroius sluggishness.
For big arrays (1000, 10000 or more items) such algorithms can lead to a serious sluggishness.
# Fast solution