Reading: Brute Force Algorithms 1

Brute force algorithms are often the simplest solutions to a given problem, though they may not be the most efficient. Good examples can be found in the string matching and sorting problems.

Reading¶

• Brute force - general definition and examples
• Brute force string matching
• Shaffer: Bubble Sort and Selection Sort
  • find sections on those topics in OpenDSA: Sorting and/or DS&AA: Section 7.2

Supplemental¶

• Sedgewick: Elementary Sorts

Levitin¶

• Levitin 3.0-3.2
  • Brute force; SelectionSort and BubbleSort; Brute force string matching