使用递归方法与非递归方法求解迷宫问题。

设有n个人围做一圈，现从某个人开始报数，数到m的人出列，接着从出列的下一个人开始重新报数，数到m的人又出列，如此下去，直到所有人都出列为止。运用循环单链表解决约瑟夫环问题。- Is equipped with n personally to encircle makes, presently starts from some person to count off, leaves ranks the number to the m person, meets from the next person which leaves ranks is starting reto count off, leaves ranks the number to the m person, continue like this, all leaves ranks until all people. Using circulates Shan Lianbiao to solve the Joseph link problem.

8 皇后问题在 python 中 八皇后益智是的放置八个问题象棋 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

计算任意的n进制的书转换到m进制的数字，用户自己定义转换进制类型

该算法在某个再生核希尔伯特空间，在充分考虑领域间分布的均值差和散度差最小化的基础上，基于结构风险最小化模型，提出一种领域适应核支持向量学习机(Kernel support vector machine for domain adaptation, DAKSVM)及其最小平方范式，通过寻求某个特征变换，使得在确保训练数据的最大分割的同时，实现领域间不同分布之间的距离充分最小化，从而实现领域适应学习。

全元主高斯－约当法消去法求线形代数方程的解-Quan-yuan main Gauss- Jordan method elimination method for linear algebraic equations

常微分方程数值解法Runge_Kutta解法-Numerical Solution of Ordinary Differential Equations Solution Runge_Kutta

基于Householder transformation的QR分解。 其使用需要调用Householder transformation程序。-Householder transformation based on the QR decomposition. The use of Householder transformation procedures need to call.

CFO(carrier frequency offset) and channel estimation in 802.11 system. The algorithm use the subspace based approach to estimate the CFO.

fortran90程序，运用Runge-Kutta法数值求解常微分方程的程序，非常适用，包括源代码、一个算例和输出程序-fortran90 procedures, the use of Runge-Kutta method for numerical solution of ordinary differential equations of the process, is very applicable, including source code, a numerical example and output procedures