Jiafei

B curve left key point, right end vevr good(Curve B left key point, right end vevr good)

作为TCP客户端跟TCP服务端进行通讯，支持modbus协议(As a TCP client to communicate with the TCP server to support the modbus protocol)

AODV的源代码，包括c++、头文件以及编写用来测试的tcl(AODV source code, including c++, head files, and write to test of TCL )

利用兼容DC保持绘图Dlg 利用兼容DC保持绘图Dlg 利用兼容DC保持绘图Dlg (Dlg use compatible DC to keep drawing to keep the use of compatible graphics Dlg use compatible DC DC kept drawing Dlg)

vc实现http下载的源代码 稍作改动可用来实现多线程 以及断点续传下载 对于想要学习http下载的朋友来说可以作为一个不错的参考(Vc realize the download HTTP source code can be used to make a little change to realize multithreading and netants download to want to learn HTTP download all of us can be used as a good reference)

说明：  vc++开发的屏幕编辑工具，已编译调试通过(vc development of the screen editing tools, compiled through debugging.)

VC源码完全模仿OICQ的界面的程序,做界面的可以下载看下。 (VC-source interface OICQ fully mimic the procedure, and can be downloaded facie interface.)

chatmad 聊天狂工具源码，适合WindowSocket编程的朋友，你懂的。(chatmad chat mad tool for source code, suitable for WindowSocket programmed friends, you know.)

e billing system written in visual basic

设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)