From 4c52b09cc1453ce535378df3a8ac3fe03405aec2 Mon Sep 17 00:00:00 2001 From: Ming Yang Date: Sun, 4 Sep 2016 00:44:45 -0400 Subject: [PATCH] Fixed typo --- seed/challenges/04-video-challenges/bigonotation.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/seed/challenges/04-video-challenges/bigonotation.json b/seed/challenges/04-video-challenges/bigonotation.json index 1dc680c91d..ff720a7a9c 100644 --- a/seed/challenges/04-video-challenges/bigonotation.json +++ b/seed/challenges/04-video-challenges/bigonotation.json @@ -52,7 +52,7 @@ "id": "56b15f15632298c12f31517a", "title": "Big O Notation: A Few Examples", "description": [ - "Time complexity is commonly estimated by counting the number of elementary operations (elementary operation = an operation that takes a fixed amount of time to preform) performed in the algorithm.", + "Time complexity is commonly estimated by counting the number of elementary operations (elementary operation = an operation that takes a fixed amount of time to perform) performed in the algorithm.", "Time complexity is classified by the nature of the function O(n). O represents the function, and (n) represents the number of elements to be acted on.", "Worst-case time complexity, the longest it could possibly take with any valid input, is the most common way to express time complexity.", "When you discuss Big-O notation, that is generally referring to the worst case scenario.",