-
数据结构 八皇后问题解决方案一 很好的代码
数据结构 八皇后问题解决方案一 很好的代码-8 Queen" s problem of data structure of a solution
- 2022-01-21 18:20:29下载
- 积分：1
-
C#数据库编程。
C#数据库编程。-Database Programming C#.
- 2023-01-09 23:15:03下载
- 积分：1
-
一个简单的数据库管理系统
一个简单的数据库管理系统-a simple database management system
- 2023-01-24 17:25:03下载
- 积分：1
-
123725
线性回归,大家仔细读啊~~~~呵呵 ,本人~~~ 用了不小时间()
- 2017-12-10 13:28:51下载
- 积分：1
-
create_hash
hash表的建立相关函数实现，比如，hash表存储数据，hash表插入数据等。(hash table to achieve the establishment of correlation function, for example, hash table to store data, hash table to insert data.)
- 2009-07-03 17:04:41下载
- 积分：1
-
Fir filter的设计,FIR滤波器系数
Fir filter的设计,FIR滤波器系数-Fir filter design, FIR filter coefficients
- 2022-03-23 06:20:25下载
- 积分：1
-
本程序是一个用prim算法寻找最小生成树的小程序。
本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.
- 2023-06-09 19:10:04下载
- 积分：1
-
数据库开发，VC应用实例教程VisualC++软件项目开发实例源码
数据库开发，VC应用实例教程VisualC++软件项目开发实例源码-Database development, VC Tutorial Application VisualC++ Examples source software project development
- 2022-06-12 10:46:15下载
- 积分：1
-
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
迷宫算法（maze）
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
-/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
- 2022-08-08 06:28:42下载
- 积分：1
-
数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。...
数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。-Data structures textbook algorithms, their own independent writing, supplementary materials, Yan Wei-Min, Tsinghua University Press. Statement: without my permission is prohibited for commercial and illicit purposes. The author of this code All Rights Reserved.
- 2022-02-21 02:11:45下载
- 积分：1
