From 430e04e3d3cee33d6ebb8ade843728a153166a9f Mon Sep 17 00:00:00 2001 From: Lavinder Singh Date: Thu, 20 Dec 2018 22:47:59 +0530 Subject: [PATCH] add the text "O(n*m) time" (#25545) --- guide/english/algorithms/brute-force-algorithms/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/guide/english/algorithms/brute-force-algorithms/index.md b/guide/english/algorithms/brute-force-algorithms/index.md index e1174e33fc..11c957cd3b 100644 --- a/guide/english/algorithms/brute-force-algorithms/index.md +++ b/guide/english/algorithms/brute-force-algorithms/index.md @@ -12,7 +12,7 @@ Some more examples of brute force algorithms are: - A 5-digit password, in the worst case scenario, would take 105 tries to crack. - A brute-force algorithm to find the divisors of a natural number n would enumerate all integers from 1 to n, and check whether each of them divides n without remainder. -The time complexity of brute force is O(n*m) . So, if we were to search for a string of 'n' characters in a string of 'm' characters using brute force, it would take us n * m tries. +The time complexity of brute force is O(n*m) . So, if we were to search for a string of 'n' characters in a string of 'm' characters using brute force, it would take O(n*m) time. #### More Information: