资源列表
Data
- 数据结构的经典数据，里面有很多实例，一看就明白-The classic data structures data, there are many examples, one can understand
Data-structure
- 严蔚敏的数据结构c语言版书，十分经典，希望能与大家共享，觉得好的，可以顶一下！谢谢！-err
Data_structures_(C_language_YanWeiMin)
- 严蔚敏的数据结构，很权威，很经典，很好用的。-Yan Wei-min data structure, very authoritative, very classic, very good use.
e1_p1
- 对于给定的整数N，设计算法求出（0，N]区间内所有满足x^2+y^2=z^2的所有正整数三元有序数组，并将结果写入文件中。-For a given integer N, design algorithm and the (0, N] range all meet x ^ 2+ y ^ 2 = z ^ 2 all positive integer ternary orderly array, and writes the result to a file.
2010011016_e4_p1
- 编写五个函数，实现对二叉树的插入、复制、删除、非递归中序遍历和层序遍历操作，理解和掌握链式存储二叉树的性质和操作方法，同时进一步熟悉指针操作。-Write five functions to achieve the insertion of binary tree, copy, delete, and non-recursive preorder traversal sequence operations, understand and grasp the nature and operatio
shujujiegou
- 数据结构课件，供初学者实用的简单资料，一些基本的程序-Data structures courseware, simple and practical information for beginners, some basic procedures
数据结构与算法分析：C语言描述 中文版
- 数据结构与算法分析(c语言版)，数据结构与算法分析的入门书籍(Data structure and algorithm analysis (C language version))
PrimTree
- 最小生成树的普里姆算法PrimTree；在一个连通网的所有生成树中，各边的权值之和最小的那棵生成树称为该连通网的最小代价生成树（Minimum Cost Spanning Tree），简称为最小生成树。 -Prim minimum spanning tree algorithm in all spanning a communication network, the weight of each side and a minimum spanning tree is called the
array
- 完成数组排序的cpp源代码，可以完成数组增加，删除，修改，排序等功能的代码-Complete source code cpp sort the array, the array can be done to add, delete, modify, sort code etc.
DataStructAlgorithmC
- 该电子书是数据结构与算法的经典书籍，相信对很对开发人员都是很有用的，特别是对使用C的朋友们。-The book is a classic data structures and algorithms books, I believe it is useful to developers, especially the use of C' s friends.
date
- 数据结构与算法分析：C语言描述+中文版，这是一本写的挺好的书，写的很全面。-Data Structures and Algorithm Analysis: C language descr iption of+ Chinese version, which is written in a very good book, written in a very comprehensive.
prolog
- 用turbo prolog编写的初级程序，是人工智能技术导论第二章的一道习题，供大家参考。-Written with the primary turbo prolog program is Introduction to artificial intelligence technology to an Exercise in the second chapter, for your reference.