1 Approximate Median tream of m elements. For simplicity, assume et S – (x1, T2,. . . , Xm) denote a s that the elements in the stream are unique. Define the position of an element to be pos(r) – | {0€ S|y 〈 x}| . The e-approximate median is then defined to be an element x such that: 2 Provide an algorithm which returns a e-approximate median with high
OR
OR