Overview
Also referred to as an “exhaustive search”, a brute force search examines each element in an array (or other data structure) in order to find a value.
Concept
Coming soon!
Algorithmic Complexity
Coming soon!
Big-O
| Algorithm | Data Structure | Time Complexity - Average | Time Complexity - Worst | Space Complexity - Worst |
|---|---|---|---|---|
| Brute Force | Array | O(n) | O(n) | O(1) |
Implementation
Java Implementation
Coming soon!
References
Wikipedia: Brute-force search