Problem
a) How many pairwise distance queries are needed in order to update cluster assignment for all N points during a K-means iteration?
b) How many pairwise distance computations are needed to update the mean value for a single mean shift iteration?
c) Which method would be more efficient for arbitrary data? Does your answer coincide with the previous two answers? Why?