Grid Search, Brute Force, Hard Work
Terminology
Grid Search
In optimization problems, dividing the Euclidean space $\mathbb{R}^{n}$ into a grid and repeatedly trying as many points as possible to find the optimal solution is referred to as Grid Search.
Brute Force
In cryptographic problems, attempting every possible combination indiscriminately to crack codes is called Brute Force.
Manual Labor
To solve problems that are either difficult or undesirable to solve, repeating possible attempts without a particular strategy is called Manual Labor.
Explanation
Although the contexts in which these terms are often used may vary, they all share the notion of doing something haphazardly. While it might be advisable to avoid the term Manual Labor in formal situations, it’s arguably the most expressive term if Korean is your mother tongue.
There might be confusion between Greedy Algorithms and Grid Search, but considering their meanings, it’s likely that the solutions obtained by Greedy Algorithms are part of those obtained through Grid Search. Just as the term ‘Greedy Algorithms’ might imply a less favorable algorithm, resorting to Manual Labor in some situations means there might not be a clever solution available or, even if automation is feasible, doing it manually a few times might be the better choice.