From f3a1e18d3ea9e14857853be542497f359fa43013 Mon Sep 17 00:00:00 2001
From: Manish kumar chaurasia <30630740+kmanish31@users.noreply.github.com>
Date: Sun, 4 Nov 2018 06:33:08 +0530
Subject: [PATCH] added example in bruteforce algo in index.md (#20117)

* added example in bruteforce algo in index.md

* Address suggested changes
---
 guide/english/algorithms/brute-force-algorithms/index.md | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/guide/english/algorithms/brute-force-algorithms/index.md b/guide/english/algorithms/brute-force-algorithms/index.md
index 79246067c4..e1174e33fc 100644
--- a/guide/english/algorithms/brute-force-algorithms/index.md
+++ b/guide/english/algorithms/brute-force-algorithms/index.md
@@ -7,7 +7,10 @@ Brute Force Algorithms refers to a programming style that does not include any s
 
 A classic example is the traveling salesman problem (TSP). Suppose a salesman needs to visit 10 cities across the country. How does one determine the order in which cities should be visited such that the total distance traveled is minimized? The brute force solution is simply to calculate the total distance for every possible route and then select the shortest one. This is not particularly efficient because it is possible to eliminate many possible routes through clever algorithms. 
 
-Another example: 5 digit password, in the worst case scenario would take 10<sup>5</sup> tries to crack.
+Some more examples of brute force algorithms are:
+
+- A 5-digit password, in the worst case scenario, would take 10<sup>5</sup> 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 <b> O(n*m) </b>. 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.