登录
首页 » Visual C++ » sy1.cpp

sy1.cpp

于 2012-10-26 发布 文件大小:2KB
0 109
下载积分: 1 下载次数: 7

代码说明:

  实验内容: 建立一个包含图书(书号,书名,定价)信息的的链表,并具有如下功能: (1) 根据指定图书个数,逐个输入图书信息; (2) 根据书名进行查找,返回此书的书号和定价; (3) 根据指定的位置可返回相应的图书信息(书号,书名,定价); (4) 给定一个图书信息,插入到表中指定的位置; (5) 删除指定位置的图书记录; (6) 统计表中图书个数。 (It is a good c++.)

文件列表:

sy1.cpp,5850,2012-10-22

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

发表评论

0 个回复

  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • 8sort_method
    随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
    2013-02-27 17:27:04下载
    积分:1
  • K_Merge
    文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
    2010-08-03 10:24:48下载
    积分:1
  • data-structure-paper
    本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
    2013-09-18 08:16:24下载
    积分:1
  • hannuota
    分析汉诺塔,选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)
    2012-05-22 18:48:33下载
    积分:1
  • library
    纯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.)
    2020-10-30 14:59:57下载
    积分:1
  • SeqQueue
    数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
    2013-06-15 16:27:32下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • min-dist
    图中计算最短路径,必须覆盖所有的节点,效率很高(to compute the shortest path in the graph)
    2012-01-06 00:03:33下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载