Week 3 Discussion Forum

Brute force Sorting

Brute force Sorting

by A.B.M Noman 192-15-2839 -
Number of replies: 0

Brute force is a straightforward approach to solving a problem, usually directly based on the problem statement and definition.


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 sizes.

5. Brute force can be used for the comparison of more sophisticated algorithms.


83 words