约瑟夫环的问题.采用循环链表来解决...简单

归并排序：将数组划分为小数组,通过局部的有序合并,解决问题 算法平均时间复杂度: O(nlogn) -Merging Sort: The array is divided into a small array, in an orderly manner through the partial merger, the average time algorithm to solve the problem complexity: O (nlogn)

对Acess数据库进行操作-right Acess database operation

亲爱的同学们是打印指令和数据库操作和不同的行动，在 php 编程

数据结构的基本操作：顺序队列的初始化、销毁、入队、出队基本操作的实现-The basic operation of the data structure: the order of the queue initialization, destruction, into the team, out of the realization of basic operations team

本源码实现了对数据库的最基本的操作，插入，修改，添加删除等基本操作，旨在对读者掌握最基本的数据库操作-The realization of the source of the most basic database operations, insert, modify, add, delete and other basic operations, aimed at the readers grasp the most basic database operations

Memory Decoder

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

STL算法实现的大整数加减法的程序， 能够进行正负数的加减，而且是动态数组的， 因此可以无限输入，这是本人这学期的大作业-STL algorithms and the largest integer addition and subtraction procedures, plus or minus a few to carry out addition and subtraction, but is a dynamic array, it can be unlimited importation, this is my semester of this operation

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

本目录存放的小波编码实现的源程序： 打开ezw2.dsw工作区，编译后可在ezw2ezwdebug中找到编码可执行程序； 在ezw2unezwdebug中找到解码可执行程序。-Wavelet realization of the source coding : Open ezw2.dsw work, compiled in ezw2 ezw debug find executable code; In ezw2 unezw debug find decoder executable.