用aspvbScript实现数据结构中的排序算法

ACCESS VBA编写系统托盘源程序源码，效果很不错-ACCESS VBA source code to prepare the system tray, the effect is pretty good

针对离散数据的光滑拟合问题，采用C++语言开发了相应的程序，将计算结果与MATLAB进行了比对，验证了程序的有效性，并且该程序的计算效率要更高，并且可以编译成脱离编程环境独立运行的exe，具有较为灵活的工程应用前景。特此分享给各位感兴趣的科研及工程工作者。

俄国人写的内存数据库的delphi封装-Russian people write memory database delphi Packaging

这是一个用PB和SQL SERVER做的课程设计,模拟完成了,银行的开户,销户,存款,取款等功能.-with PB and SQL SERVER do curriculum design, simulation completed, the bank accounts, and marketing of households, deposits, withdrawals and other functions.

数据结构中迷宫问题的求解，迷宫问题.vcproj 这是使用应用程序向导生成的 VC++ 项目的主项目文件。 它包含生成该文件的 Visual C++ 的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。 迷宫问题.cpp 这是主应用程序源文件。 StdAfx.h, StdAfx.cpp 这些文件用于生成名为 迷宫问题.pch 的预编译头 (PCH) 文件和名为 StdAfx.obj 的预编译类型文件。 -Data structure to solve the problem in the maze, the maze problem. Vcproj This is using an application wizard to generate the VC++ project the main project document. It contains the document to generate Visual C++ version information, as well as applications relating to the use of the wizard select the platform, configuration and project features. Maze problem. Cpp This is the main application source file. StdAfx.h, StdAfx.cpp these files used to generate a maze called the question. Pch precompiled header (PCH) files and named StdAfx.obj type of pre-compiled files.

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

C++写的归并排序算法，非递归，简单高效-the nonrecursive code of mergesort

GFDGRTFDGFHGHFGFHGFGCFDGDFGEWTRRETERTRETTTTTT公司

在各种各样的搜索算法中，AVL树的搜索算法可以将其最短的搜索时间做一个保证，本程序就是实现了AVL搜索算法-in a wide variety of search algorithm, AVL tree search algorithms can be the shortest time to do a search that The procedure is to achieve the AVL Search Algorithm

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.