Search Algorithms

Question 1

The process of searching through an ordered set of data using the “divide and conquer” technique, which guarantees a final result in O(log N) times.

Answer 1

Binary Search

Question 2

An algorithm for traversing or searching a tree or graph data structures. It typically starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors.

Answer 2

Breadth First Search

Question 3

A very general problem-solving technique that consists of systematically checking all possible solutions or values. The breadth first search and depth first search are two examples.

Answer 3

Brute Force Search

Question 4

In searching a tree structure, this search process explores one complete branch of a tree all the way to the end of the branch before proceeding to another branch.

Answer 4

Depth First Search

Question 5

AI search technique that employs heuristic for its moves. Heuristic is a rule of thumb that probably leads to a solution.

Answer 5

Heuristics Search

Question 6

A loop based search process using an array of values that starts looking at the first of the list and continues towards the end of the list until the target is found, or until the end of the array is reached

Answer 6

Linear Search or Sequential Search