What is local search and global search?

The difference between a local search algorithm (such as beam search) and a full search algorithm (such as A*) is, for the most part, small. In computer science, local search is a heuristic method for solving computationally complex optimization problems. The local search can be used in problems that can be formulated such as the search for a solution that maximizes a criterion among a series of candidate solutions. Local search algorithms move from one solution to another in the candidate solution space (the search space) by applying local changes, until a solution that is considered optimal is found or a deadline has elapsed.