arehmanali/brute-force-maximum-sub-array-algorithm

Brute-Force-Maximum-Sub-Array-Algorithm

Brute Force Algorithms refers to a programming style that does not include any shortcuts to improve performance, but instead relies on sheer computing power to try all possibilities until the solution to a problem is found. 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 105 tries to crack.

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.