Calender

算法导论的英文版，讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)

数据结构的一些简单的排序算法，有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)

多项式相加的数据结构试验·············(Polynomial sum test data structure)

编程 主范式 使用真植表 用栈的应用 使用了 后缀表达式 (biancheng zhu fanshi)

猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)

八皇后问题，用vc编写了一个可以解决八皇后问题的程序，实现了递归调用。(The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

矩阵运算器，c语言编程，数据结构，免费下载(Matrix calculator, c language programming, data structures, free download)