Skip to content

Commit 371060c

Browse files
authored
Merge pull request #702 from mrmowji/patch-2
Typo correction
2 parents 87bb908 + 20ee100 commit 371060c

File tree

1 file changed

+1
-1
lines changed
  • 1-js/05-data-types/04-array/10-maximal-subarray

1 file changed

+1
-1
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@ alert( getMaxSubSum([100, -9, 2, -3, 5]) ); // 100
5959

6060
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.
6161

62-
For big arrays (1000, 10000 or more items) such algorithms can lead to a seroius sluggishness.
62+
For big arrays (1000, 10000 or more items) such algorithms can lead to a serious sluggishness.
6363

6464
# Fast solution
6565

0 commit comments

Comments
 (0)