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

sy1.cpp

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

代码说明:

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

文件列表:

sy1.cpp,5850,2012-10-22

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

发表评论

0 个回复

  • DP
    说明:  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
    2012-11-12 08:52:31下载
    积分:1
  • RBtree
    使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
    2014-05-16 16:09:57下载
    积分:1
  • Hanoi
    简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
    2012-07-16 20:48:59下载
    积分:1
  • 2007327
    带权有向以及无向图的各种操作,适合数据结构初学者使用,是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
    2007-04-22 23:49:54下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • maze
    说明:  由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
    2011-03-27 20:57:47下载
    积分:1
  • 8_queen
    8_queen问题的一个自创的算法,还不错!(8_queen)
    2009-10-21 11:49:24下载
    积分:1
  • 04huffman_a
    根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
    2007-05-29 19:15:26下载
    积分:1
  • BSM
    一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
    2008-05-04 13:42:30下载
    积分:1
  • huisuo
    实现回溯算法,能解决八皇后问题等~~算法结果优化,时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
    2011-12-14 11:59:39下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载