GUI_32

说明：  该代码是一个基于MATLAB语言编辑的四面体有限元长应变四面体算法，包含一个例子很实用，性能稳定。感谢大家的分享。(This code is a kind of constrain Tetrahedral fem compution on MATLAB。there are total code and an example in cube。It is very practical and stable。thank you for your exchanging。 )

这是一个用AnCAD公司的matfor图形包写的一个小程序，实现了类似matlab封面三维图形功能，用该图形包代码量少，个人认为比matlab更能满足用VC开发的朋友。(This is a company with AnCAD graphics package matfor write a small program to achieve a similar three-dimensional graphics functions matlab cover, using the graphics package code less, think more than matlab personal use VC development to better meet friends.)

matlab程序的课程设计与要求，在matlab中的应用 (matlab process)

六自由度机械臂调试程序源码，国外的的，具有非常高的借鉴意义 (Six degrees of freedom manipulator debugger source, abroad, the very high reference)

说明：  在VC++中调用Matlab引擎的两个例子(In VC++ calling Matlab engines in the two examples)

Add a button on main window title bar

说明：  递归，是函数实现的一个很重要的环节，很多程序中都或多或少的使用了递归函数。递归的意思就是函数自己调用自己本身，或者在自己函数调用的下级函数中调用自己。 递归之所以能实现，是因为函数的每个执行过程都在栈中有自己的形参和局部变量的拷贝，这些拷贝和函数的其他执行过程毫不相干。这种机制是当代大多数程序设计语言实现子程序结构的基础，是使得递归成为可能。(Recursion, is a function to achieve a very important part of many programs are more or less use the recursive function. Recursive mean that the function of its own call to themselves or subordinates in their own function calls a function to call their own. Recursion that can be achieved because the function of each execution in the stack has its own shape parameters and local variables of the copy, the copy and the implementation process has nothing to do other functions. This mechanism is the most modern programming language implementation subroutine structure of the foundation is to make recursion possible.)

Modul convertion Gregorian Date to Lunar Date Visual Basic 6.0.

lapack的c++版本之一.lapack是imsl,mkl,matlab等大部分数值计算的使用者.最早是for77的,后来出现c++,java等的.(lapack one of the c version. Lapack is imsl, mkl. Matlab, and most numerical calculation users. The first was for77, subsequently c, java and so on.)

第k小元素（分治法） 给定一个线性序列集，要求求出其中指定的第K小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；(First k small element (divide and conquer) Given a set of linear sequence, where the specified requirements determined the K value and the small number of locations, such as a given n elements and an integer i, 1 ≤ i ≤ n, output this is the n elements of the i-th element value and the position of the small )