Useful Links
Computer Science
Algorithms and Data Structures
Algorithm Design and Analysis
1. Introduction to Algorithms
2. Algorithm Analysis
3. Brute-Force and Exhaustive Search
4. Divide and Conquer
5. Greedy Algorithms
6. Dynamic Programming
7. Backtracking and Branch-and-Bound
8. Graph Algorithms
9. String Matching Algorithms
10. Computational Complexity Theory
11. Advanced Topics in Algorithm Design
Brute-Force and Exhaustive Search
Introduction to Brute-Force Strategy
Definition and Characteristics
When to Use Brute-Force
Applicability and Limitations
Time-Space Trade-offs
Examples of Brute-Force Algorithms
Sequential Search
Linear Search in Arrays
Linear Search in Linked Lists
String Matching
Naive Pattern Matching
Analysis and Optimization
Sorting Algorithms
Selection Sort
Bubble Sort
Closest-Pair Problem
Pairwise Distance Computation
Optimization Opportunities
Traveling Salesperson Problem
Enumerating All Permutations
Complexity Analysis
Subset Generation
All Subsets
All Permutations
All Combinations
Previous
2. Algorithm Analysis
Go to top
Next
4. Divide and Conquer