登录
首页 » Visual C++ » sf_2014320164457

sf_2014320164457

于 2014-04-03 发布 文件大小:7KB
0 238
下载积分: 1 下载次数: 3

代码说明:

  数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)

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

发表评论

0 个回复

  • abc
    数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
    2013-12-03 15:57:53下载
    积分: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
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • InverseList
    说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
    2011-04-04 11:15:58下载
    积分:1
  • Tetris
    使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
    2013-03-27 10:51:16下载
    积分:1
  • huffman_src22
    本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
    2007-06-15 16:02:25下载
    积分:1
  • MyKD Tree
    KD树算法,能够实现对点云数据进行压缩,非常简单,适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
    2015-06-24 20:10:33下载
    积分: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
  • Poly
    多项式相加的数据结构试验·············(Polynomial sum test data structure)
    2010-12-24 15:11:55下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载