3.1.3 - Searching algorithms

Question 1

Linear search

Answer 1

A linear search checks each item in a list one by one until the desired item is found or the end of the list is reached.​

Question 2

Binary search

Answer 2

A binary search repeatedly divides a sorted list in half to find the desired item more efficiently.

Question 3

What are the advantages of a linear search?

Answer 3

Works on unsorted lists
No need for complex algorithms​

Question 4

What are the disadvantages of a linear search?

Answer 4

Can be slow for large lists
Inefficient compared to binary search on sorted data

Question 5

What are the advantages of a binary search?

Answer 5

Faster than linear search for large, sorted lists

Question 6

What are the disadvantages of a binary search?

Answer 6

Requires the list to be sorted
More complex to implement than linear search

Question 7

When is a linear search more appropriate than a binary search?

Answer 7

When dealing with small or unsorted lists

Question 8

When is a binary search more appropriate than a linear search?

Answer 8

When dealing with large, sorted lists where search efficiency is important.​