C#源码，第三方控件，用于表格控制。支持字段拖动式，动态查询等特殊效果。...

这是全智能充电器的全部代码之VI部分，一个很好很实用的充电器程序。(This is a full-smart charger all the code of the VI part of a good charger is very useful program.)

俄罗斯方块 纯C 语言版；精巧实现； 只有一个源码文件， 编译时请加上-std=c99 参数； gcc -std=c99 Tetris.c (Pure C language version of Tetris exquisite realization only one source file, when compiling with-std = c99 parameters gcc-std = c99 Tetris.c)

PWM输入+DMA，亲测可用，有需要的朋友可以自行下载。(PWM input + DMA, pro-test available.)

经典矩阵运算问题求解(classic problem solving matrix operations)

基于MFC在编辑框中实现文件的打开、查找和关键字搜索定位等功能(Based on MFC it realized the openning and searching of files or texts in your edit box and so on )

DS102_DS112 日本骏河精机直线滚珠导轨资料(DS102DS112 japan machine)

说明：  嵌入式系统的建模及matlab仿真，同时给出相应的C++实现代码(failed to translate)

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

持续在屏幕上打印出玫瑰花，任意键退出。使用MFC编写。(Continuously print out rose on the screen, any key to exit. Writing with MFC.)

矩阵各种运算，包括矩阵加减，矩阵相乘，矩阵求逆，和转置-matrix