EmailToGsm,邮件短信自动通知系统

在TEC―2教学机上扩展出如下几条指令，包括确定指令格式和具体内容，指令执行步骤，每一步的操作功能和控制信号等，最后在教学计算机上真正实现出来，调试正确并应用在要求的程序设计中。 要求扩展的指令： ⑴ 比较两个无符号数，并根据比较的记过转移 ① 高于或等于则转移 ② 低于或等于则转移 程序设计要求： 按收键入的n个数据，排序后显示在屏幕上。按键选择下列排序方式： ⑴无符号数排升序 ⑵无符号数排降序-the TEC-2 aircraft to expand teaching the following several directives, including the identification of specific instruction format and content of instruction execution steps, each step of the operation function and control signals, the last in teaching computer truly realize, debug and correct application of the requirements of the program design. The request to expand the order : 1 compared with two symbols, and a comparison under the demerits transfer greater than or equal to a transfer less than or equal to a transfer of program design requirements : by the admission of n-type data sequentially on the screen. Click the following Sort : 1 unsigned row ascending 2 unsigned row descending

目录里是《设计模式简单代码》的全部工程，里面对应于每个模式都是有一个对应的可编译工程的。-Directory is

计算机主机网关的作用是什么？假设你的名字叫小不点，你住在一个大院子里，你的邻居有很多小伙伴，在门口传达室还有个看大门的李大爷，李大爷就是你的网关-Mainframe computer What is the role of gateway? The assumption that your name does not叫小point, you live in a compound yard, your neighbors, there are many small partners, at the door there is a janitor

wince无线点菜软件,具备常规点菜的所有功能,可直接使用-wince wireless a la carte software, with all the features of conventional a la carte can be used directly

Windows PE文件格式分析与PEDUMP的实现-Windows PE File Format Analysis and realization of PEDUMP

一个将MP3文件转换为WAV文件的源程序，需要mp3play.ocx-An MP3 file will be converted to WAV files source, the need mp3play.ocx

flex和ajx 的结合 ,在myeclipse下开发的-The combination of flex and ajx in myeclipse developed under the

用堆栈完成简易计算器的c程序 对数据结构的初学者有很大的帮助-Using the stack to complete simple calculator c program data structures are very helpful for beginners

pb提供了可在MDI窗口中显示图片及各种内容的一种方法，它既不需要API调用也不需要定制MDI窗口，它仅仅使用PB的一般编程技巧，你很容易就会弄明白它的原理:它不过是一个比较特殊的Sheet而已！它特殊在什么地方呢，还是你自己去看吧!-pb in the MDI window display pictures and the contents of a method, it does not need an API call does not need to customize MDI windows, it is only the general use of PB programming skills, you can easily find out the principle : it is a rather exceptional Sheet! Its special in any place, or look at your own!

以深度为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).