Exercise 1 element of a set n distinct integers in O(n + k log n) time. Describe your algo- rithm in a short and clear paragraph, in natural language, that explains how the data structure is constructed. Also carefully explain why your algorithm has this performance (including the construction of the data structure). You may assume that n is of the form 2 for some h and that: Develop an algorithm
OR
OR