This source code package is Cell Components VB some sample application code, inc...

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

[问题描述] 将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

我自己写的AOE网络算法-I wrote it myself AOE Network Algorithm

这是一个用CUDA平台实现的简单的排序。具有参考价值-This is a simple to use CUDA platform of the sort. With a reference value

扩充了C++ Builder DBGRID 控件的功能，实现隔行变换颜色等功能-Expansion of the C++ Builder DBGRID control functions, the realization of interlaced color transform functions

串的Replace函数-Series Replace function

ORACLE数据库的交集查询-the intersection of inquiries

这是一个好用的MD5的C++类；这个类可以加在控制台 程序中也可用在MFC中， 并且提供了详细的错误处理 函数，是一个安全的类。例程是一个MD5的MFC程序， 支持字符串和文件两种输入。 LPCSTR TargetFile(char *filename=NULL) //计算文件的MD5值 void TargetStr(LPCSTR str) //计算字符串的MD5值 LPCSTR GetDigestKey() //取MD5运算后的结果 LPCSTR GetErr() //如果有错误，取错误字串-This a user-friendly MD5 C; This category can be added to the Console program is available in MFC, and provided a detailed error handling function, is a safety class. MD5 is a routine MFC procedures, and documentation to support a string of two input. LPCSTR TargetFile (char* filename = NULL)// calculate MD5 value of the document void TargetStr (LPCSTR str)// calculate MD5 string value LPCSTR GetDigestKey ()// Operational MD5 from the results LPCSTR GetErr ()// If there were mistakes from the wrong string

从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as binary sort tree nodes in the data field" s value, and the establishment of a binary sort tree to achieve binary tree insertion sort. To leaf insertion method, that the new nodes are inserted to change the binary tree leaf node, and in order to meet the orderliness.

本程序能读取系统环境变量,查看有无鼠标 .若有,便输出Mouse is OK, 反之便输出No mouse.