Week 3 Discussion Forum

Brute Force Sorting and String Matching

Brute Force Sorting and String Matching

by Amran Ali 192-15-2853 -
Number of replies: 0

Brute force is a straightforward approach to solving a problem, usually directly based on the problem statement and definition...(Levitin 2007) The author attempts to give some motivation to this chapter: 1. Brute force is applicable to a wide variety of problems. 2. For some problems does generate a reasonable algorithm. 3. If the problem is only infrequently solved then the expense of developing a better algorithm is not justified. 4. The brute force algorithm may be good for small problem size. 5. Brute force can be used for the comparison of more sophisticated algorithms.

95 words