Exhaustive Search Algorithm

From GM-RKB

Jump to navigation Jump to search

An Exhaustive Search Algorithm is a search algorithm that tests every set member.

AKA: Exhaustive Search.
See: Greedy Search Algorithm, Search Task, Approximate Search Algorithm.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Exhaustive_Search_Algorithm&oldid=687055"

Concept