Description: monarchy and colonialists who have successfully used the divide and conquer strategy can also be used in high-efficiency computer algorithm design process. This chapter will begin with an introduction in how the algorithm design of the application of this ancient strategy, and then use this strategy to solve the following problems : minimum biggest problem, matrix multiplication, incomplete chessboard, sorting, selection, and a computational geometry problems-- two-dimensional space to find the nearest two points. This chapter is given to analysis of divide and conquer algorithm complexity of the mathematical methods and derived through the largest and the smallest order of the complexity threshold to prove divide and rule
To Search:
File list (Check if you may need any files):
分治.txt
Download