登录
首页 » Visual C++ » yuesefu

yuesefu

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

代码说明:

  数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)

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

发表评论

0 个回复

  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • d
    说明:  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
    2013-11-29 14:32:18下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • code
    各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
    2010-06-22 11:11:45下载
    积分: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
  • migong
    迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
    2011-06-11 17:13:39下载
    积分:1
  • SHU
    为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)
    2013-07-25 01:35:56下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载