初学者学习c语言数据结构的编码，

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

JAVA数据结构与算法的二叉树用小应用程序实现-Java data structures and algorithms with small Application Binary Tree Program

uart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreu

icarnegie ssd7数据库系统网上教材（含练习）-online database system icarnegie ssd7 materials (including practice)

Complex VB OPC Automation Example

这是两个集合交并的一个算法-two pools and a reference algorithm

严蔚敏编写的《数据结构》第6章的答案，全部为源码-the answers of chapter 6 of a book called ‘Data Structures’ writen by Yan Wei Min

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

绿色征途2 本帖最后由 quyan123456789 于 2013-8-28 16:59 编辑 $ Z: [. G6 {& h6 u  M) M1 e* B 帖子发了将近有1年时间了，现在成了置顶帖很高兴

先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔