Algorithms For Dummies

 

»

Bidirectional search: This technique searches simultaneously from the root 

node and the goal node until the two search paths meet in the middle. An 

advantage of this approach is that it’s time efficient because it finds the 

solution faster than many other brute-force solutions. In addition, it uses 

memory more efficiently than other approaches and always finds a solution. 

The main disadvantage is complexity of implementation, translating into a 

longer development cycle.

---

CHAPTER 2

  Considering Algorithm Design 

     35

Using a heuristic and a cost function

For some people, the word heuristic just sounds complicated. It would be just as 

easy to say that the algorithm makes an educated guess and then tries again when 

it fails. Unlike brute-force methods, heuristic algorithms learn. They also use cost 

functions  to  make  better  choices.  Consequently,  heuristic  algorithms  are  more 

complex, but they have a distinct advantage in solving complex problems. As with 

brute-force algorithms, there are many heuristic algorithms and each comes with 

its own set of advantages, disadvantages, and special requirements. The following 

list describes a few of the most common heuristic algorithms: