登录
首页 » Visual C++ » library

library

于 2020-10-30 发布 文件大小:1487KB
0 247
下载积分: 1 下载次数: 9

代码说明:

  纯C语言编程的模拟现有图书馆的借阅、续借、归还;图书入库、出库;查询、排序等功能,实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询,排序功能有六种,界面可变色,里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)

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

发表评论

0 个回复

  • 12
    说明:  哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
    2011-05-06 14:42:14下载
    积分: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
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • KMP
    数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
    2013-03-27 14:04:39下载
    积分: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
  • C1
    说明:  由C程序实现的 数学上 滑雪问题 的代码实现,供大家学习用(Ski problem code for all to learn to use)
    2011-05-28 14:51:40下载
    积分:1
  • sort
    数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)
    2008-06-14 20:52:24下载
    积分:1
  • binarytree
    二叉树的操作,涉及到三种顺序的遍历,树的凹入表示法,转化为一维数组储存,节点的计数,以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
    2011-05-24 20:31:13下载
    积分:1
  • xiao-yuan-dao-you
    说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
    2011-03-21 19:54:06下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载