资源列表
data_structure3
- 9、优先级队列 QueueNode.h Compare.h PriorityQueue.h Test.cpp 10、串 88 MyString.h MyString.cpp test.cpp 11、二叉树 BinTreeNode.h BinaryTree.h Test.cpp 12、线索二叉树 ThreadNode.h ThreadTree.h ThreadInorderIterator.h te
lianbiao
- 作业题，链表的基本操作（插入，删除，长度，查找等等）。初学数据结构，程序的优点在于好懂。-Operating title list of basic operations (insert, delete, length, look, etc.). Learning data structures and procedures to better understand the advantages.
paixuqiehuan
- 从文件读入20组数据，用快速排序，每次分割标记分割点。当元素下降到3个时，切换为简单插入排序。-Reading from the file data into 20 groups, using quick sort, split points for each partition tag. When reduced to three elements, the switch to a simple insertion sort.
shuanfa
- 学习C语言,学习数据结构的演试软件,有流程,源代码,单步跟踪,图文并茂!-Learning C language, learning the speech test data structure software processes, source code, single-step tracking, with the aid of diagrams!
cys
- 这事一个重言式判定程序，程序存在一点问题还望各位不吝赐教啊-eeeeeeeeeeeeeeiouykyrirtyui
dashuxiangjia
- 大数相加的程序-failed to translate
linklist
- 数据机构中的双向链表，可用来实现并集，并且是用c++编制-for(i=1 i<=link1.GetLengthofLink() i++) { int e=link1.GetElement(i) if(link2.LinkLocate(e)==0) { newnode=(struct node*)malloc(sizeof(struct node)) newnode->data=e newnod
sort
- 介绍了三种排序与查找算法：选择排序算法，冒泡排序算法，折半查找法-selection sort,bubble sort,find
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图，用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
dijkstra
- 用C语言实现dijkstra算法-Using C language algorithm dijkstra
c
- 快速排序算法，次算法基于分支策略的排序算法，对于输入的数组按从小到大进行排序. 创建一个二叉树的二叉链表结构，然后输出从根结点到所有叶子结点的路径。-quick_sort and binary_tree
DataStructure
- 用C语言编写实现数据结构方面的例子，如栈，队列，二叉树等！-Using C language data structures examples, such as stacks, queues, binary tree, etc.!