Visual-CPP

超级文本文档，实现日历，内存查看，鼠标坐标显示，改变字体，背景颜色(Hypertext documents, realization of the calendar, memory view, the mouse coordinates display, change fonts, background color)

《圈圈教你玩USB》随书光盘(第2章) ( The circle USB teach you to play CD with the book (chapter second))

从ring3切换到ring0的代码(-The code which can exchange ring3 to ring0)

FT的驱动代码，费了好大的劲才获得的，请参考并提出宝贵意见。(FT s driving code,it s very difficult to get it, please refer to it and give you good opinion.)

说明：  汤姆斯旺C＋＋编程秘诀，下载后解压缩即可(Thomas Wong C programming tips, download can decompress)

实现DSP傅里叶变换以及傅立叶反变换的源程序，C语言实现。(Implement DSP Fourier transform, and inverse Fourier transform of the source, C language.)

VC++、sql server合同管理源代码，仅供参考！(VC++,sql server,source code！)

RS 编码,RS码是一类有很强纠错能力的多进制BCH码(RS code)

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

一个VB6编写的表格控件，对与我们学习控件编写很不错。(Write a VB6 grid control, we can learn to write and very good control.)