Dijkstra

约瑟夫问题，用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems，30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )

数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)

C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)

说明：  离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)

简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )