Index of /videos/courses/algo-003/03 - III. DIVIDE CONQUER ALGORITHMS (Week 1)/04 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min)

	Name	Last modified	Size	Description
	Parent Directory		-
	30 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4	2013-12-16 16:32	36M
	30 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt	2013-12-16 16:32	52K
	30 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).txt	2013-12-16 16:32	36K
	algo-closest1-annotated-final.pptx	2013-12-16 16:32	3.2M
	algo-closest1.pdf	2013-12-16 16:32	3.1M
	algo-closest1_typed.pdf	2013-12-16 16:32	2.1M