• Skip to primary navigation
  • Skip to content
  • Skip to footer
Dr. Khalil Chebil
      • Algorithm Design and Analysis
        • CS 3401 Main Page
        • 1. Introduction
        • 2. Algorithm Analysis
        • 3. Brute force and Exhaustive Search
        • 4. Decrease and conquer
        • 5. Divide and conquer
        • 6. Transform and conquer
        • 7. Dynamic programming

      Brute force and Exhaustive Search

      Slides

      Implementations

      The convex Hull problem

      The closest pair problem and the convex Hull problem
      Knapsack problem with brute force
      Depth First Search
      Breadth First Search
      © 2025 Dr. Khalil Chebil. Powered by Jekyll & Minimal Mistakes.