随笔分类 -  数据结构与算法分析

15. 二项队列
摘要：fatal.h binomial.h binomial.c 阅读全文
posted @ 2017-02-10 03:34 typewriter 阅读(354) 评论(0) 推荐(0)
14. 斜堆（skew heap）
摘要：fatal.h skewheap.h queue.h skewheap.c queue.c testskew.c c include "skewheap.h" include define MaxSize 32 int main() { PriorityQueue H; int i, j, MinE 阅读全文
posted @ 2017-02-09 01:43 typewriter 阅读(542) 评论(0) 推荐(0)
13. 左式堆（left heap）
摘要：fatal.h leftheap.h queue.h leftheap.c queue.c testleft.c c include "leftheap.h" include define MaxSize 10 int main() { PriorityQueue H; int i, j, MinE 阅读全文
posted @ 2017-02-08 10:59 typewriter 阅读(310) 评论(0) 推荐(0)
12. 二叉堆（binary heap）
摘要：fatal.h binheap.h binheap.c testheap.c c include "binheap.h" include define MaxSize (33) int main() { PriorityQueue H; int i, j; H = Initialize(MaxSiz 阅读全文
posted @ 2017-02-08 02:47 typewriter 阅读(341) 评论(0) 推荐(0)
11. 开放定址散列表
摘要：fatal.h hashquad.h hashquad.c testhash.c c include "hashquad.h" include define NumItems 110 int main() { HashTable H; Position P; int i; int j = 0; in 阅读全文
posted @ 2017-02-06 19:21 typewriter 阅读(291) 评论(0) 推荐(0)
10. 分离链接散列表
摘要：fatal.h hashsep.h hashsep.c testhash.c c include "hashsep.h" include define NumItems 400 int main() { HashTable H; Position P; int i; int j = 0; int C 阅读全文
posted @ 2017-01-17 02:05 typewriter 阅读(238) 评论(0) 推荐(0)
9. avltree
摘要：fatal.h avltree.h queue.h avltree.c queue.c testavl.c c include "avltree.h" include "queue.h" include int main() { AvlTree T; int i; int j = 0; T = Ma 阅读全文
posted @ 2017-01-10 17:21 typewriter 阅读(300) 评论(0) 推荐(0)
8.二叉查找树
摘要：fatal.h tree.h tree.c testtree.c c include "tree.h" include int main() { SearchTree T; Position P; int i; int j = 0; T = MakeEmpty(NULL); for (i = 0; 阅读全文
posted @ 2016-12-26 17:03 typewriter 阅读(201) 评论(0) 推荐(0)
7.队列的链表实现
摘要：fatal.h queueli.h queueli.c testqueueli.c c include include "queueli.h" int main() { Queue Q; int i; Q = CreateQueue(); for (i = 0; i 阅读全文
posted @ 2016-12-23 04:10 typewriter 阅读(257) 评论(0) 推荐(0)
6.队列的数组实现
摘要：fatal.h queuear.h queuear.c testqueuear.c c include include "queuear.h" int main( ) { Queue Q; int i; Q = CreateQueue( 12 ); for( i = 0; i 阅读全文
posted @ 2016-12-23 03:54 typewriter 阅读(224) 评论(0) 推荐(0)
5.栈的链表实现
摘要：fatal.h stackli.h stackli.c teststkl.c c include include "stackli.h" int main() { Stack S; int i; S = CreateStack(); for (i = 0; i 阅读全文
posted @ 2016-12-22 15:41 typewriter 阅读(213) 评论(0) 推荐(0)
4.栈的数组实现
摘要：fatal.h stackar.h stackar.c teststka.c c include include "stackar.h" int main() { Stack S; int i; S = CreateStack(12); for (i = 0; i 阅读全文
posted @ 2016-12-22 15:27 typewriter 阅读(232) 评论(0) 推荐(0)
3.线性表-cursor
摘要：fatal.h cursor.h cursor.c c include "cursor.h" include include "fatal.h" / Place in the interface file / struct Node { ElementType Element; Position N 阅读全文
posted @ 2016-12-22 03:39 typewriter 阅读(186) 评论(0) 推荐(0)
2.线性表-Linked list
摘要：fatal.h linkedlist.h linkedlist.c testlinkedlist.c c include include "linkedlist.h" void PrintList(const List L) { Position P = Header(L); if (IsEmpty 阅读全文
posted @ 2016-11-09 17:27 typewriter 阅读(374) 评论(0) 推荐(0)
1.线性表-Array
摘要：fatal.h array.h array.c testarray.c c include include "array.h" void PrintList(const List L) { Position P = Header(L); if (IsEmpty(L)) printf("Empty l 阅读全文
posted @ 2016-11-09 03:25 typewriter 阅读(275) 评论(0) 推荐(0)