From 20ee100c2048928e2284bf9eff86d9576c32c7a5 Mon Sep 17 00:00:00 2001 From: Mojtaba Javan Date: Thu, 27 Dec 2018 04:53:34 +0330 Subject: [PATCH] Typo correction "seroius" to "serious" --- 1-js/05-data-types/04-array/10-maximal-subarray/solution.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/1-js/05-data-types/04-array/10-maximal-subarray/solution.md b/1-js/05-data-types/04-array/10-maximal-subarray/solution.md index a2ba50bf..3b82e645 100644 --- a/1-js/05-data-types/04-array/10-maximal-subarray/solution.md +++ b/1-js/05-data-types/04-array/10-maximal-subarray/solution.md @@ -59,7 +59,7 @@ alert( getMaxSubSum([100, -9, 2, -3, 5]) ); // 100 The solution has a time complexety of [O(n2)](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