From 072b80babcd0e46da68439f75bb927b923025916 Mon Sep 17 00:00:00 2001 From: Rohit Pai Date: Wed, 7 Sep 2016 17:08:26 +0530 Subject: [PATCH] Resolved #9655:Big-o-notation... --- challenges/04-video-challenges/bigonotation.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/challenges/04-video-challenges/bigonotation.json b/challenges/04-video-challenges/bigonotation.json index ff720a7a9c..5ce137cd0a 100644 --- a/challenges/04-video-challenges/bigonotation.json +++ b/challenges/04-video-challenges/bigonotation.json @@ -76,7 +76,7 @@ ], "tests": [ [ - "Algorithms expressed exponentially like O(N^2) can work well in certain situations, so you shouldn't avoid them completely.", + "Algorithms expressed exponentially like O(C^N), where C is a constant can work well in certain situations, so you shouldn't avoid them completely.", false, "While they can work in certain small scale situations, they aren't good practice because they will not work larger scale." ],