Brute Force Algorithm Quiz

Understanding Brute Force Algorithm Design Technique and Its Applications

• Brute Force Algorithm Design Technique is also known as “proof by exhaustion” and is a method of mathematical proof.
• The technique splits the statement to be proved into a finite number of cases or sets of equivalent cases and checks if the proposition holds for each type of case.
• Brute Force Algorithm Design Technique is a straightforward approach to problem-solving that gives a clear idea of what approach to use.
• The technique uses computer power rather than intellectual power and means “just do it.”
• Brute Force Algorithm Design Technique is applicable to a wide variety of problems, including sorting, searching, and string matching.
• The technique yields reasonable algorithms of at least some practical value with no limitation on instance size.
• Brute Force Algorithm Design Technique can still be useful for solving small-size instances of a problem and serve an important theoretical or educational purpose.
• The strengths of the technique include its wide applicability, simplicity, and reasonable algorithms for some important problems.
• The weaknesses of the technique include its inefficiency and unacceptably slow algorithms for some problems.
• Sorting algorithms include Selection sort and Bubble sort, while Sequential Search is used for searching problems.
• Brute Force String Matching involves finding an exact copy of pattern/s with all substrings of a given text by comparing each character until a match is found.
• The Assignment problem requires pairing of 𝑛 people to execute 𝑛 jobs in such a way that the total cost/profit of the pairings is minimized or maximized. The Hungarian Method is used to find minimum matches.
• Exhausative search is a brute-force approach to combinatorial problems that systematically generates a list of potential solutions, evaluates them one by one, and keeps track of the best one found. The Traveling Salesman Problem is an important example.