登录
首页 » Others » 4317973

4317973

于 2018-03-14 发布 文件大小:50KB
0 198
下载积分: 1 下载次数: 1

代码说明:

  工会管理系统源代码,全面实用,可以参考,()

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

发表评论

0 个回复

  • Huffman
    数据结构实验之哈夫曼算法,欢迎下载指正。带有可执行程序(Experimental data structure of the Huffman algorithm.Welcome to download correction. With an executable program)
    2013-12-07 20:58:01下载
    积分:1
  • delete
    删除数组中小于某个特定值的所有函数,或删除大于某个特定值的所有函数,或删除某一指定范围内的所有元素,用二叉树实现(Delete all functions in the array that are less than a particular value, or delete all functions that are larger than a particular value, or delete all elements within a specified range, with a binary tree)
    2017-07-10 16:19:49下载
    积分:1
  • 一个很好的员工信息管理系统
    一个很好的员工信息管理系统-a good staff information management system
    2022-04-01 21:41:11下载
    积分:1
  • 运动会分统计系统 的课程设计
    运动会分数统计系统 数据结构的课程设计-Games scores of statistical systems data structures curriculum design
    2022-10-25 08:20:02下载
    积分:1
  • 这是我的课程设计源代码,请务必按提示输入,该程序的功能是用链表实现多项式的四则运算。...
    这是我的数据结构课程设计源代码,请务必按提示输入数据,该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.
    2022-08-16 11:50:15下载
    积分:1
  • ikteefeceratemutable
    利用时域有限差分法计算电磁波对目标的RCS()
    2017-12-05 07:59:14下载
    积分:1
  • Divided ideological merge sort is very important sub
    分治的思想 归并排序 分治是很重要的方法 归并排序是一种快速的排序-Divided ideological merge sort is very important sub-rule method is a quick sort merge sort
    2022-03-14 12:53:38下载
    积分:1
  • PB下的ATM机开发案例。谢谢参考!
    PB下的ATM机开发案例。谢谢参考!-PB下的ATM机开发案例。谢谢参考!啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊
    2022-08-25 13:55:38下载
    积分:1
  • pinfanfangwen
    设有一头指针为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.)
    2015-01-15 22:31:59下载
    积分:1
  • 经曲的字符串匹配模糊搜索算法 思想不是本人的,但程序是本人编写的...
    经曲的字符串匹配模糊搜索算法 思想不是本人的,但程序是本人编写的-By the song
    2022-05-08 01:05:57下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载