登录
首页 » Visual C++ » Josephus

Josephus

于 2012-12-20 发布 文件大小:1KB
0 172
下载积分: 1 下载次数: 3

代码说明:

  实现约瑟夫问题的4种算法,并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)

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

发表评论

0 个回复

  • Hash
    基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)
    2012-11-04 16:45:04下载
    积分:1
  • DLinkedList
    双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
    2013-07-17 15:38:38下载
    积分:1
  • dxsjjc
    多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)
    2009-12-29 11:13:13下载
    积分:1
  • qiongju
    八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
    2013-08-14 22:21:28下载
    积分:1
  • QUICKSORT
    用C语言实现的普通快速排序,和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)
    2015-01-12 15:00:00下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • class
    拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)
    2016-12-12 14:53:46下载
    积分:1
  • Lists
    用模板实现了单向链表的增删改查等功能,并且适用于多种数据结构和类,简单实用,是学习和使用的绝好资料(Template to achieve a one-way linked list CRUD functions, and is suitable for a variety of data structures and classes, simple and practical, is to learn and use excellent information)
    2014-06-02 13:36:32下载
    积分:1
  • nuaa1108
    说明:  nuaa1108 多少连续的1 解题报告(Problem solving report )
    2009-08-23 10:01:05下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载