登录
首页 » Visual C++ » 约瑟夫环的循环链表实现

约瑟夫环的循环链表实现

于 2005-07-03 发布 文件大小:5KB
0 157
下载积分: 1 下载次数: 939

代码说明:

  约瑟夫环的循环链表实现,这个程序比较完整,有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • X_bit0mintest
    X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
    2011-07-02 21:37:01下载
    积分:1
  • SplitADT
    链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
    2007-03-30 20:48:18下载
    积分:1
  • yongzhanshixianleicaozuo
    自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
    2007-12-25 22:28:05下载
    积分:1
  • ddt
    多段图、遍历、排序。用C语言解决多段图中的成本问题,得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )
    2012-05-12 13:49:10下载
    积分:1
  • binary
    实现对二叉树的操作:建树、遍历、求层高、叶子数和结点数等(binary tree)
    2011-12-09 15:58:29下载
    积分:1
  • hafumanTree
    数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
    2011-01-02 13:15:23下载
    积分:1
  • Brute-force-algorithm
    穷举算法,VC中的经典程序之一,适合初学者,(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
    2012-06-06 21:20:06下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • adms
    阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
    2012-06-09 11:27:18下载
    积分:1
  • 5-source--code-of-DS--PRO
    数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
    2011-05-18 17:01:17下载
    积分:1
  • 696518资源总数
  • 105549会员总数
  • 12今日下载