登录
首页 » Visual C++ » shujujiegoukechengshiji

shujujiegoukechengshiji

于 2008-06-16 发布 文件大小:8KB
0 208
下载积分: 1 下载次数: 24

代码说明:

  数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)

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

发表评论

0 个回复

  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • kmp
    数据结构中的用kmp算法查找关键字,供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)
    2011-11-16 22:16:33下载
    积分:1
  • c-language-book
    C常用算法程序集,一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)
    2011-12-14 23:01:04下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • CAR
    some problems about c++.(car.cpp)
    2012-01-12 14:39:48下载
    积分:1
  • 0712233
    数据结构c语言版,图的遍历,周游世界,无向图的遍历,包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)
    2009-12-20 17:04:09下载
    积分:1
  • floy
    floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
    2007-11-13 23:39:25下载
    积分:1
  • BiTree
    二叉排序树的建立、插入与删除。按递增顺序插入N个整数,并按同样顺序删除;(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )
    2020-09-05 16:38:05下载
    积分:1
  • paixu
    实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
    2012-05-21 22:13:12下载
    积分:1
  • Four-bracket-operator
    数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
    2011-12-12 10:51:31下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载