Algorithmic Strategies: brute force, greedy, divide-and-conquer

ACM Body of Knowledge

• Topics:

  • [Core-Tier1]

    • Brute-force algorithms

    • Greedy algorithms

    • Divide-and-conquer

• Learning Outcomes:

  • [Core-Tier1]

    • 1. For each of the strategies (brute-force, greedy, divide-and-conquer, recursive backtracking, and dynamic

    • programming), identify a practical example to which it would apply. [Familiarity]

    • 2. Use a greedy approach to solve an appropriate problem and determine if the greedy rule chosen leads to an

    • optimal solution. [Assessment]

    • 3. Use a divide-and-conquer algorithm to solve an appropriate problem. [Usage]

Key Resources

• Textbook

  • Chapter 2. The Stack.

    • When reading textbooks, use the SQ3R technique.

• Tutorial

  • Stack tutorialspoint

• Topics

  • Brute-force algorithms

  • Greedy algorithms

    • Greedy Algorithms tutorialspoint

    • TopCoder Greedy is good

    • Greedy Algorithms | GeeksforGeeks (5:31)

  • Divide-and-conquer

    • Divide and Conquer tutorialspoint

Test Yourself

• TACHSTCK , editorial CodeChef

Exercise Resources

• Stack Class in Java GeeksforGeeks