gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added caveat about brute force algorithms (#28079)

Browse Source
This commit is contained in:
Aaron Fox
2019-03-25 23:34:41 -04:00
committed by Randell Dawson
parent 772f4e1c40
commit 3055dfc912
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
guide/english/algorithms/brute-force-algorithms/index.md
View File

@ -14,6 +14,8 @@ Some more examples of brute force algorithms are:
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 O(n*m) time. 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 O(n*m) time.
Generally, brute force approaches should be avoided for more optimal algorithms, especially when the functions using these algorithms will scale to larger and larger numbers. The difference between brute force and optimized algorithms may not be immediately apparent when dealing with smaller numbers and lesser chunks of time, but the difference between a brute-force O(n^3) algorithm and an optimized O(nlog(n)) algorithm becomes very apparent for problems of larger scales.
#### More Information: #### More Information:
<a href="https://en.wikipedia.org/wiki/Brute-force_search"> Wikipedia </a> <a href="https://en.wikipedia.org/wiki/Brute-force_search"> Wikipedia </a>