unix上的ODBC实现

用c#编写的多元线性回归模型，一元当然也可以用-With c# written in a multiple linear regression model, a dollar of course, can also be used

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

背包问题(非0/1)C++标准算法-knapsack problem (0/1) C Standard Algorithm

n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last

最简单的Delphi班级管理系统-most simple Delphi class management system

可能是最快的排序算法.源代码和演示文件.-probably is the fastest sorting algorithms. Source code and presentations.

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各子系统具有独立的数据库结构，设计时力求简单易用，便于维护。各模块为平行关系，彼此间无直接的参数联系，也无库的交叉关联，从而保证各子系统可以单独运行。-the system using Visual Foxprow 5.0 preparation, visual, object-oriented programming, allowing the system to adapt to the current development trend in fashion. Used in the design of the popular top-down waterfall structure design method. The subsystem is independent of the database structure, design sought to be simple to use, easy to maintain. Each module for parallel relationship between the parameters are not directly linked, nor for the cross-linked, so that the subsystems can be run separately.

ASP+ACCESS 的东西，请看下。我很想下载点东西。谢谢了。-ASP+ACCESS

我们数据结构课上的一些作业 包括约瑟夫环和哈夫曼树之类的几个程序-Our data structure class operations, including some of Joseph Huffman tree rings and several procedures, such as