network message boards No. 2004 v1.0

这是一个简单的动态现实的约瑟夫环 用于排除制定圈内的某个人-this is a simple system for yuesefu loop

QT和FireBird的入门程序，FireBird是一个开源的轻量级数据库管理系统，可在Linux,Unix,MacOS,Windows,Solaris系统下运行。包括源文件和说明文档。-This article is the description of the first steps in setting QT, Visual Studio and FireBird. It may be useful for those, who just start working with database FireBird Embedded by means of QT provider. The article will be also helpful for the developers who just start working with QT.

深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick

难得的好程序，是有关数据库的-rare good procedure, the database

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

一个用C++实现的B+tree程序源代码-b+tree implemented with c++

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

数据仓库建模技术详解-data warehouse technology Elaborates on Modeling

几个C的小程序，有汉诺塔，数环打印，链表的创建并自动排序 -several small programs, Tower of Hanoi, several Central Print, Chain automatically create and order

Storm可以非常可靠的处理庞大的数据流，用于处理Hadoop的批量数据。Storm很简单，支持许多种编程语言。是处理大数据的得力助手。