文件名称:No11
介绍说明－－下载内容均来自于网络，请自行研究使用
本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。
-This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
-This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
No11.htm