The specific question:
A fellow student wants to compactly store A1 and A2 to support efficient range reporting queries on both arrays using a single binary search. He suggest using fractional cascading (as described in the lecture). Explain why this will not work.
I cannot understand why this will not work.
If we want to search for a specific key in both arrays, why does it matter if the data is related or not? If we have built a relationship between the two arrays, s.t. we can follow a pointer to a predecessor for a given index in A1, is it not irrelevant?