Closest pair of points

Lecture Algorithm design - Chapter 5: Divide and conquer I include all of the following: Mergesort, counting inversions, closest pair of points, randomized quicksort, median and selection. For more details, inviting you refer to the above lesson.

59p youcanletgo_03 14-01-2016 53 2   Download