1. divide and conquer
see: http://www.cse.ust.hk/faculty/scheng/comp3711h/notes/array.pdf
can also use our method of BST.
both nlogn
2. closest pair
divide and conquer
3. minimum spanning tree:
prim's algorithm
kruskal algorithm
Dijkstra’s algorithm and prim's algorithm
skyline problem: divide and conquer == search + bst
Showing posts with label divide and conquer. Show all posts
Showing posts with label divide and conquer. Show all posts
Thursday, February 28, 2013
Subscribe to:
Posts (Atom)