用C实现的基于O

你好 我开发了此应用程序只用了 1 天，我相信你们都喜欢这个应用程序，并且学到很多东西特别是初学者。 谢谢你 J@n@k

hash 文件操作（数据结构）-hash file operations (data structures)

Bbd 示例软件访问-ADO 查询-在 DBGrid 显示按字母顺序排列的结果-添加、 删除和更改对编辑、 备忘录、 组合框和复选框，编辑搜索中按 Enter 键截潜-对话框，以确认删除，......

二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non- recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values

SQLite浏览器-1.3-src.tar.gz文件伟大的

通过builder实现的数据结构各种算法 由于本人编程技术还没成熟，不足之处还请见谅-builder achieve through the data structure algorithms as I mature programming No shortage Department also requested forgiven

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

以visual studio 2005为开发环境的约瑟夫环设计。-Environment: visual studio 2005

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

this cscan algo in c-this is cscan algo in c++