是数据结构中的基数排序算法，挺不错的，谢谢大家

数据结构里的判断两点之间是否有简单路径和判断是否有简单回路，用vc6.0编写-data structures between 2:00 judgment whether a simple path and determine whether there is any simple circuit, prepared with vc6.0

主分量变换，不要密码。-PCA transform, not passwords.

一个彩票选号的随即函数值！ 其实，很简单，大家看以下！-a lottery Dip the function immediately! In fact, very simple, we look at the following!

该软件模拟数据结构的算法实现-the software simulation data structure Algorithm

Java数据结构和算法（第二版）-lafore著，教材中使用到的APPLET。-Java data structures and algorithms (second edition)-lafore, and materials used to APPLET.

多线程进行二分排序法，递归产生新线程，每一个父线程产生两个子线程，接着父线程对两个子数组进行合并-Multi-thread two hours sorting method, recursive generate a new thread, each thread is a parent produces two sub-threads, then the parent thread to merge the two sub-arrays

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

开发过程中，总会遇到把一个数据表的行，以列的形式查询出来，这是一个动态的查询方法。以前总是容易忘记，发上来给新手看吧！这些命令多操作后就记住了， 

企业固定资产管理系统-Enterprise Fixed Assets Management System

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.