登录
首页 » Visual C++ » yeschengxu

yeschengxu

于 2013-12-22 发布 文件大小:32KB
0 159
下载积分: 1 下载次数: 4

代码说明:

  这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)

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

发表评论


0 个回复

  • eitTableParse
    该程序分析eit表的数据结构,病输出相应内容信息(parse eit table and output content info)
    2016-05-22 17:52:42下载
    积分:1
  • BinaryTreeViaMFC
    画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)
    2011-05-27 20:14:36下载
    积分: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
  • PolynomialCoeff
    NTL应用——大数系数多项式乘法的计算。从文件读如参数,计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
    2021-04-11 09:58:58下载
    积分:1
  • radixsort
    对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
    2007-10-16 19:11:53下载
    积分:1
  • huffman
    使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
    2013-07-15 23:59:47下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • strcon
    对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
    2011-09-02 16:52:40下载
    积分:1
  • 1
    说明:  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分:1
  • 696518资源总数
  • 104993会员总数
  • 17今日下载