Prepare a paper about 1 algorithm 2 sample problem for this algorithm (Please avoid problems like adding and removing element) . You do not code. Just explain the idea and relation with that algorithm...

Brute force Approach
An algorithm is the most effective method for expressing the problem using finite amount of the space and time. It is the well-defined formal language which is used to calculate the function. We can start from the initial state and initial input. The instructions are used for describing the computation which will be executed, and it will proceed through the finite number of the well-defined successive states. This will eventually produce the output and terminate with the help of final ending state. The transition from one state to another is not required in the deterministic manner. It can be done at the random flow by using random input and they are known as the randomized algorithms. The
ute force approach is known as the exhaustive search.
The
ute force me that we are going through the possible solutions. It is one of the easiest methods for solving the problem. If we talk about this approach in terms of the space and time complexity, then it takes a hit. It isn't direct, straightforward and intuitive technique to solve the problem in which all the possible methods or the possible solutions for the given problem are enumerated. There are many problems in our daily life which can be solved with the help of
ute force strategy. For example, we can explore all the parts for the nea
y market to find the shortest path.
Another example is to a
ange the books in the rack with the help of possibilities to optimize the space of the rack at the maximum. The daily life activities are using
ute force nature even they are possible with the optimal algorithms. There are different advantages and disadvantages of utilizing this approach to solve the problem.
The advantages of
ute force approach are”
· this approach is the guaranteed method for finding the co
ect solution as it will list all the possible candidate solutions for solving that particular problem.
· It is the generic method, and it does not limit itself for the specific domain of the problems.
· It is the ideal solution to solve simple and smaller problems.
· This approach is known for its simplicity and can be used as the comparison benchmark.
The following are the disadvantages of following this approach:
· This approach is not efficient. If we are solving the real time problems, then the algorithm analysts can go above the O(N!) order of the growth.
· The
ute force approach relies more on compromising the power of the computer system to solve the problem as compared with a good algorithm design.
· This approach is slower than other approaches.
· The
ute force algorithms are not creative or constructive as compared with the other algorithms which have constructive nature with the help of other design paradigms.
The
ute force algorithms are exactly the same as this sound. They are the straightforward methods which are used for solving the technique. These problems rely on the sheer computing power and try eating every possibility instead of using advanced techniques for improving the efficiency. For example, if we imagine that we are having a small padlock which has four digits each can range from zero to 9.
We forgot the combination and do not want to buy another padlock. As we cannot remember any of the digits then we can use the
ute force method to open the lock.
We will set all of the numbers again to 0 after which strive them separately with the aid of using converting 1 digit at a time and ca
y out the equal till the lock opens. In the worst state of affairs it'll take 10,000 attempts to discover the actual combination. Another traditional instance of this method in pc technology is the touring salesman problem. Suppose the salesperson desires to go to ten exceptional towns throughout the country. Now how we can decide the order wherein the ones towns may be visited in order...