MFC-Sample

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

一个对日期编写的函数。 在VC6.0下实现。(Date of preparation of a function. Achieved in VC6.0.)

一个有关获取主机名和IP地址的MFC程序，对于初学者来说很有帮助(For information about obtaining a host name and IP address of the MFC, very helpful for beginners)

由于传统的 COM 技术使用静态的非托管编程,net使用动态的托管编程(Because of the traditional COM technology using static unmanaged programming,.net using dynamic managed programming)

针对离散小波变换对于图像平移和旋转的敏感性,提出了一种基于可操纵金字塔的图像匹配算法。(Discrete wavelet transform for image translation and rotation sensitivity of a steerable pyramid-based image matching algorithm.)

说明：  一个能显示柱形图功能的源码，方便初学者使用。(A bar graph showing the function of the source code for beginners to use.)

AddFlowCrack have a good time

说明：  这个源代码讲的是MFC的对话框的应用程序(The source code is MFC dialog about the application)

ATMEGA16寄存器说明应用，特别实用(ATMEGA16 register to illustrate the application, especially useful)

SPIHT算法是一种简单易懂、有效的嵌嵌入式零树编码算法，需要的自然明白它的作用 (SPIHT algorithm is a simple, effective embedded in the embedded zero-tree coding algorithm, the natural to understand its role)