登录
首页 » Visual C++ » library

library

于 2020-10-30 发布 文件大小:1487KB
0 293
下载积分: 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 个回复

  • traversinggraph
    图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)
    2010-08-14 14:16:10下载
    积分:1
  • calculation
    数据结构计算算术表达式算法,可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)
    2010-12-24 13:11:25下载
    积分: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
  • 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
  • hill-climbing
    改进爬山算法,用于风力发电机实现风能最大追踪,找到最佳叶尖速比,实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)
    2017-02-26 12:21:08下载
    积分:1
  • search
    数据结构与算法分析的 C++检索代码,很经典(the code of Data structure)
    2016-12-22 13:30:46下载
    积分:1
  • paixu
    使用的排序算法,非常不错的思维,比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)
    2009-05-05 17:54:54下载
    积分:1
  • BinaryTree
    数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
    2010-06-26 10:51:43下载
    积分:1
  • main
    求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
    2016-03-29 19:29:19下载
    积分:1
  • SelectSort
    选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
    2012-09-27 22:38:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载