Question 1:

The linear time median find algorithm of the set for which the median is to be found into groups of 5. Why does this not work with groups of 3 elements?

Question 2:

How can we get a list of post order numbers in sorted order without sorting? We want linear time not Nlogn.

Question 3:

Do a breath first search proof using a loop invariant to show that a breath first search is capable of computing all layers of a graph.

**Subject Computer Science Data Structures and Algorithms**