A program declares a 1D array globally as PartName[1:1000000] OF STRING, and sorts its contents in ascending alphabetical order. The function PartSearch performs a binary search on the array. The item to be found is passed as a parameter. If it is found, its location in the array is returned, otherwise,

- 1

is returned.

Complete the following table to define the variables used in the function.

Identifier	Data type	Description
Left	Table answer row1_Data type	Table answer row1_Description 0 words
Right	Table answer row2_Data type	Table answer row2_Description 0 words
Mid	Table answer row3_Data type	Table answer row3_Description 0 words
Target	Table answer row4_Data type	Table answer row4_Description 0 words

10(a)(ii)Searching AlgorithmsHard5 marks

Complete the pseudocode for the function to perform a binary search on PartName using all the variables from the table in 10(a)(i). Some lines may be left blank.

pseudocode

01FUNCTION PartSearch(0203ENDFUNCTION

Answer

0 words

10(b)Algorithm Efficiency Big OMedium2 marks

Describe how the time efficiency of a binary search changes as the number of items in the search list increases. Refer to Big O notation in your answer.

Answer

0 words