数据结构实验与实训教程 书籍语言： 简体中文 书籍类型： 程序设计 授权方式： 免费软件 书籍大小：...

这是一个用来查询历史数据的小程序，它曲线、柱状图来显示的-This is a historical data used to query a small program that curve, histogram to show the

数据结构教程 C-data structure tutorial for c

fortran常用算法集。-FORTRAN commonly used algorithm sets.

论坛中有许多操作Access数据库的介绍、说明，示例代码等资源，但感觉总是不太连贯和全面，给急需想要使用Access数据库做开发的朋友不少遗憾。本代码是一个封装完整的Access数据库类，包括Ole版本协商、数据库优化、数据库连接等等。由于接口非常简单易懂，读者下载后即可直接投入使用，非常方便。不过，由于Access DAO不支持多线程，所以在本代码中没有实现更好的替代方案，这也是读者在使用本代码的过程中需要注意的一个地方。由于本人水平有限，程序中难免会有很多缺陷，还请各位高手指点！

这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)

计算机算法设计，用于设计贪心算法，你们懂得-Computer algorithms designed for the design of dynamic programming, you know

利用f90接口创建nc文件，并演示4维数据的创建方法-Nc file created using f90 interface and a demonstration of four-dimensional data to create methods

数据结构课程设计报告1-sergyrt hgrth

迷宫算法（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.

这是用QB编的排序程序。利用条形显示冒泡排序、快速排序、等五种排序方法。 效果一流，对于C语言，数据结构爱好者是不错的选择。-This is the sort made by QB procedures. Strip shows that the use of Bubble Sort, Quick Sort, five sorting method. The effect of first-class, for C language, data structure enthusiasts is a good choice.