Login or Create an Account to view the mark scheme, comment, and add to a test
Consider those algorithms which apply the principle of divide and conquer to more efficiently implement search.
(a).
State the name of a dynamic data structure suitable for maintaining a list of names in such a way as to facilitate faster searching.
[1]
(b).
Sketch the data structure suggested in part (a) formed as the following names are provided sequentially from left to right, that is, Kris is input first and Linda last.
[3]
Kris, Andrew, Dan, Kate, Linda

Extended Response4 MarksCommunity
27 Uses60 Views0 Likes