代码名称：资料管理系统 一个资料管理系统的源程序，VB+ACCESS2000+ADO，功能强大...

ORACLE 数据备份,实现oracel数据库的正提，表，记录的分别备份,功能强大，操作方便，可以放心使用，

该源码实现二叉树的模拟，运行时图片已经放在压缩文件夹下。-The realization of the source tree of the simulation, run-time image compression has on the folder.

采用VC++6.0 + Ado开发 除了基本的增删改之外，还有以下特色 **可以直接将照片存于数据库，不必担心因为系统路径改变导致的更改。 **支持简单查询，模糊查询和精确查询和多种排序功能。 **双击左侧列表即可进行更改，右键保存。 **系统界面美观。 屏幕分辨率：1024*768　效果最佳 有需要源代码的朋友，通过电子邮件与本人联系。 Email:linchangcheng007@163.com 进一步了解本人相关作品，请访问本人的Blog。 Blog: http://blog.csdn.net/linchangcheng007/ 花了几天时间做的东东。对于VC开发，数据库开发入门来说很不错的。-Used VC++ 6.0+ Ado development apart from the basic to the additions and deletions, there are the following features can be directly** photos stored in the database without having to worry about because the system led to changes in the path of change.** Support a simple query, fuzzy query and precise queries and a variety of sorting functions.** Double-click the list on the left you can make changes, right-preservation.** System Interface beautiful. Screen Resolution: 1024* 768 best source code need to have a friend by e-mail with my contact. Email: linchangcheng007@163.com to learn more about my work-related, please visit my Blog. Blog: http://blo

以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic.

数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree

计算PI的值有各种各样 ，看看这个算法是不是很简洁呢-Calculated PI values are varied, to see if this algorithm is not very simple and does

We discussed two versions of the 3-sum problem: A "naive" implementation (O(N^3)) and a "sophisticated" implementation (O(N^2 lg N)). Implement these algorithms.  Your implementation should be able to read data in from regular data/text file with each entry on a separate line.

北京化工大学2008年暑期集训一次训练的解题报告和核心代码-Beijing University of Chemical Technology in 2008 summer training report of a problem-solving training and core code

一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究.-a compression algorithm, named PPMD, higher compression ratio, and can make its own decisions and build, please algorithm research colleagues to study together.

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword