登录
首页 » Visual C++ » pinfanfangwen

pinfanfangwen

于 2015-01-15 发布 文件大小:1KB
0 104
下载积分: 1 下载次数: 11

代码说明:

  设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

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

发表评论

0 个回复

  • ANT
    A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
    2012-05-17 09:14:21下载
    积分:1
  • 00
    说明:  还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)
    2012-06-17 21:36:24下载
    积分:1
  • Data-structure-diagram
    数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)
    2011-06-27 09:29:40下载
    积分:1
  • 第4章
    清华大学出版社,数据结构简明教程李春葆著,第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)
    2018-02-03 14:39:12下载
    积分:1
  • calc
    这是我在学习数据结构做练习时写的一个小程序,功能是在命令行下进行形如:23+34*3/4+(3*6+10)的四则运算,支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)
    2009-12-28 12:15:21下载
    积分:1
  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分:1
  • 5100309203_5_8
    二叉树类的前序,后序,层次遍历,其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)
    2012-12-16 14:16:41下载
    积分:1
  • bookmanage
    基于数据结构的图书管理系统,基本功能都有,可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)
    2020-10-27 00:00:04下载
    积分:1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • 5100309373_2_9
    数据结构习题答案,线性链表的实现与适用,数据结构:思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
    2012-11-23 11:12:48下载
    积分:1
  • 696518资源总数
  • 104223会员总数
  • 35今日下载