哈夫曼编码（数据结构与算法分析课程设计实验源代码）

在m×n的矩阵中有一个元素a[i,j]满足下述条件：a[i,j]既是第i行元素中的最小值，又是第j列元素中的最大值（称为鞍点），此程序是求矩阵鞍点的算法-In the m × n matrix has an element of a [i, j] satisfy the following conditions: a [i, j] is not only the first i elements of the minimum trip, but also is the first j elements out of the maximum value (called saddle point), this procedure is the saddle point matrix algorithm

Windows CE 写的透明处理实例，欢迎捧场。-Windows CE was dealing with an instance of a transparent, welcome to join in.

一个编写今日界面todayscreen的一个小程序-An interface todayscreen today to prepare a small program

基于Boost.Asio实现的HTTP客户端开发工具库, 它支持HTTP(1.0/1.1)、HTTPS，断点续传，多线程并发下载，异步，HTTP/SOCKS4/SOCKS5代理支持等特性，开发者可以轻松的基于这个库开发其他相关应用。

颜色识别 大家可以下载看看 或者参考下-Color identification to see if we can download or refer to the following

操作系统的一个小程序，就是一个分区管理程序，仅供学习用-operating system a small program is a regional management procedures, only to learn from

J1939 prootol training details

以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).

an example for uninstaller

This program is a Number to Text converter. which can convert a given number (range from one to hundred of vigintillion(10^63) ) to the text that people use to pronouce the number. Feel free to use this code and please give feedback to me. Right now it works for AMERICAN ENGLISH. This code is copyrighted and has limited warranties.