I have tried Googling the term "Brute force". But I come across two different definitions which leave me confused.
Definition 1: Brute Force is the most basic and simplest type of algorithm. A Brute Force Algorithm is the straightforward approach to a problem i.e., the first approach that comes to our mind on seeing the problem.
Definition 2: Brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem’s statement.
Can someone answer in Yes or NO that if a particular algorithm does not search the entire solution space but happens to be logically straightforward or the first approach that comes to mind , then would it be " Brute Force " ?
Yes, someone can answer: I can.
My answer is: NO. When we say 'brute force' we talk about a solution space that can be exhaustively searched. Definition 1 omits that limitation, so it is false.
If you see Definition 1 in the context of all exhaustively searcheable solution spaces, it stays false, since 'our mind' is different for everyone.