登录
首页 » Visual C++ » LinearList

LinearList

于 2012-10-31 发布 文件大小:5070KB
0 75
下载积分: 1 下载次数: 2

代码说明:

  单链表程序 可执行单链表的基本功能 创建 删除 查找 存取 等等(Basic functions to create a single linked list program executable single linked list delete find access)

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

发表评论

0 个回复

  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分: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
  • BinaryTree
    c++数据结构中的二分查找树,是比较基本的数据查找结构,查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)
    2009-10-31 20:04:38下载
    积分:1
  • huffman
    使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
    2013-07-15 23:59:47下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • m-in
    说明:  数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)
    2008-09-25 08:06:33下载
    积分:1
  • text
    输入N个点的坐标,判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)
    2011-12-13 09:43:42下载
    积分: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
  • SplitADT
    链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
    2007-03-30 20:48:18下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • 696524资源总数
  • 103945会员总数
  • 46今日下载