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

分治.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．