登录
首页 » Visual C++ » yuesehuhuan

yuesehuhuan

于 2007-11-22 发布 文件大小:11KB
0 184
下载积分: 1 下载次数: 1

代码说明:

  就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)

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

发表评论

0 个回复

  • 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
  • huffman_tree
    数据结构学习中提供的不错的源码,一个哈夫曼树类,利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)
    2013-12-28 15:21:48下载
    积分:1
  • ysph
    约瑟夫环,数据结构算法,挺有意思,看看,看看(ysphdfgfgf)
    2009-03-14 00:16:15下载
    积分:1
  • Well-tested-algorithm
    效验算法单循环链表,这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)
    2011-08-02 12:20:21下载
    积分:1
  • 001
    二叉树的中序遍历,先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)
    2012-06-03 23:26:44下载
    积分:1
  • 1
    说明:  四路归并排序,将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)
    2012-12-07 14:16:36下载
    积分:1
  • KMP---MFC
    数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
    2020-07-04 08:40:01下载
    积分:1
  • shu
    大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)
    2017-11-10 13:44:35下载
    积分:1
  • paixu
    使用的排序算法,非常不错的思维,比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)
    2009-05-05 17:54:54下载
    积分: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
  • 696518资源总数
  • 106010会员总数
  • 4今日下载