Searching Algorithm

Question 1

What is Linear Search?

Answer 1

Process of looping through the list iteratively, one by one and checking if the specified value exists.

Question 2

What is Binary Search?

Answer 2

Algorithm for searching a sorted array. It works by repeatedly dividing the search space in half until the target element is found.

Question 3

Give an example of binary search

Answer 3

Picking a middle spot/number in the list (search key), if the number where the search key is higher/bigger than the target element. Then cut the algorithm in half by removing the right/upper side, narrowing the search interval. Otherwise, narrow the search by cutting the left side, this is then done repeatedly until the value is found or the interval is empty.