10.2. Arrays
A subsection of Computer Science, 9618, through 10. Data Types and Structures
Listing 1 of 1 questions
A binary search or a linear search can be used to look for a specific value in an array. Complete this pseudocode algorithm for a linear search. DECLARE MyList : ARRAY[0:9] OF INTEGER DECLARE MaxIndex : INTEGER DECLARE Index : INTEGER DECLARE Found : BOOLEAN DECLARE ValueToFind : INPUT ValueToFind Found ← FALSE Index ← 0 MaxIndex ← REPEAT IF MyList = ValueToFind THEN Found ← TRUE ENDIF Index ← UNTIL Found OR Index > MaxIndex IF Found THEN OUTPUT "Value found at position ", Index ELSE OUTPUT ENDIF State the necessary condition for a binary search. Describe how to perform a binary search. Explain how the performance of a binary search varies according to the number of values in the array. Compare the performance of the algorithms for a binary search and a linear search using Big O notation for order of time complexity.
9618_s22_qp_32
THEORY
2022
Paper 3, Variant 2
View
Questions Discovered
1