Brute Force
Using the example of Linear Search in an unsorted array, this lesson gives a gentle introduction to the brute force paradigm.
We'll cover the following...
Brute force method
Let’s start off our discussion on algorithms with the most straightforward and exhaustive option—the brute force approach to solving a problem. This method requires us to go through all the possible solutions to the problem we are meaning to solve. For instance, if we have an array of integers and we want to find the minimum, maximum, or a certain element in that array, the brute force approach requires us to go through all the elements to find that specific element. There are no shortcuts and no performance improvements at this stage.
Even ...