Element Uniqueness £ Closest Pair
					Claim: Element Uniqueness £ Closest Pair Proof: • Convert the n numbers into points on the x-axis • Find the closest pair of points • The closest pair is distance zero iff the initial elements were not unique Conclusion: Closest Pair requires W(n log n) time
		• We accept two lower bounds as given – Element Uniqueness requires W(n log n) time – Sorting requires W(n log n) time (we proved this)
			CS409 - Spring 2000				6