一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究....

A*算法的演示程序，可以自由设置障碍和地形，单步演示A*算法的寻路过程。包含源码，是学习A*算法的最佳工具。-A* algorithm demo program, they can set up obstacles and terrain, single-step demonstration of the A* search algorithm road course. Includes source is studying A* algorithm for the best tools.

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

C#中，应用程序与数据库access的链接解释-C#, applications and database access links to explain the

针对Excel表格文件操作的编程实现 可实现读写和表格查询-against Excel spreadsheet file manipulation of the program can achieve literacy and form inquiries

数据结构课程的作业，代码通俗易懂，且运行效率高。-Data structure course work, the code easy to understand, and operating efficiency.

图书系统管理系统-Library System Management System

实现如何利用VB创建ACCESS 2000格式的数据库及数据库表,里面含有一个很好的表格近代件,支持背景图片显示!-realize how to use VB to create 2,000 ACCESS database format and database tables, which contains a very good form of modern pieces, support background images show!

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

本文是介绍数据结构中的二分查找，比较数等思想及算法的-this paper is to introduce the data structure to search two hours, a few more ideas and algorithms

很多的vb经典源代码-many classic vb source code