登录
首页 » Visual C++ » 3_abstract_data_struct

3_abstract_data_struct

于 2008-04-14 发布 文件大小:11KB
0 95
下载积分: 1 下载次数: 3

代码说明:

  数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )

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

发表评论

0 个回复

  • 5100309203_5_8
    二叉树类的前序,后序,层次遍历,其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)
    2012-12-16 14:16:41下载
    积分:1
  • hash
    使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
    2011-08-19 21:25:34下载
    积分:1
  • yuyundonghui
    参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目,项目编号分别为 和 。由于各项目参加人数差别较大,有些项目取前五名,得分顺序为7,5,3,2,1;还有些项目只取前三名,得分顺序为5,3,2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单,内容包括各校所取得的每项成绩的项目号、名次(成绩)、姓名和得分;产生团体总分报表,内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据:对于 , , ,编号为奇数的项目取前五名,编号为偶数的项目取前三名,设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)
    2009-04-07 22:40:37下载
    积分:1
  • Hash-table
    本代码主要实现了哈希表的设计,完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
    2013-12-30 17:15:14下载
    积分:1
  • 2007327
    带权有向以及无向图的各种操作,适合数据结构初学者使用,是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
    2007-04-22 23:49:54下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • paixu
    2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
    2008-12-10 16:53:40下载
    积分:1
  • 3_abstract_data_struct
    数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
    2008-04-14 22:56:33下载
    积分:1
  • DP
    说明:  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
    2012-11-12 08:52:31下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载