Searching Algorithms (AQA GCSE Computer Science)

State the comparisons that would be made when the linear search algorithm is used to search for the value 8 in the following array (array indices have been included above the array).

State the comparisons that would be made when the binary search algorithm is used to search for the value 8 in the following array (array indices have been included above the array).

A sample of data is shown in Fig. 4.

Fig. 4

Show the stages of a binary search to find the word zebra using the data shown in Fig. 4.

State two advantages of a linear search compared to a binary search.

You are given two different lists of data: one sorted and one unsorted.

List A (Unsorted):
["pear", "orange", "banana", "apple", "mango", "grape"]

List B (Sorted):
["apple", "banana", "grape", "lemon", "mango", "orange", "pear", "watermelon"]

Explain, step by step, how you would use a linear search to find the word 'mango' in List A.

Explain, step by step, how you would use a binary search to find the word 'mango' in List B.

Compare the advantages and disadvantages of both linear and binary search algorithms.

Explain in which scenarios one algorithm would be preferred over the other.

A section of code from a linear search is given below

list = [7, 1, 4, 2, 8]
target = 4
found = False

# Loop through each element in the list
for _____ in _____(0,___(list) - 1):

Complete the missing Python code to correctly loop through each element in the list.

State the purpose of -1 in the loop in part A.

You are given the following sorted list of numbers:

[2, 9, 15, 22, 30, 41, 53, 66, 71, 83, 97]

Complete a binary search to find the number 22.

Show each step in the search, indicating the middle element and how the list is divided at each step.

You are given the following sorted list of words:

["apple", "banana", "cherry", "grape", "lemon", "mango", "orange", "peach", "pear", "plum", "watermelon"]

Complete a binary search to find the word peach.

Show each step in the search, indicating the middle element and how the list is divided at each step.