可视化的数据结构和算法
这东西不错，以后可以看看。
via: http://coolshell.cn/articles/4671.html
基础
Stack栈: 数组实现 http://www.cs.usfca.edu/~galles/visualization/StackArray.html
Stack栈: 链表实现 http://www.cs.usfca.edu/~galles/visualization/StackLL.html
Queues队列: 数组实现
http://www.cs.usfca.edu/~galles/visualization/QueueArray.html
Queues队列: 链表实现 http://www.cs.usfca.edu/~galles/visualization/QueueLL.html
Lists列表: 数组实现
http://www.cs.usfca.edu/~galles/visualization/java/visualization.html
Lists列表: 链表实现
http://www.cs.usfca.edu/~galles/visualization/java/visualization.html
索引
Binary Search Trees http://www.cs.usfca.edu/~galles/visualization/BST.html
AVL Trees (平衡二叉检索树)
http://www.cs.usfca.edu/~galles/visualization/AVLTree.html
Red-Black Trees 红黑树 http://www.cs.usfca.edu/~galles/visualization/flash.html
Open Hash Tables 开放哈希表(Closed Addressing 链地址法)
http://www.cs.usfca.edu/~galles/visualization/OpenHash.html
Closed Hash Tables 闭合哈希表 (Open Addressing 开放定址法)
http://www.cs.usfca.edu/~galles/visualization/ClosedHash.html
Closed Hash Tables, using buckets
http://www.cs.usfca.edu/~galles/visualization/ClosedHashBucket.html
B Trees http://www.cs.usfca.edu/~galles/visualization/BTree.html
B+ Trees http://www.cs.usfca.edu/~galles/visualization/BPlusTree.html
排序
Comparison Sorting
http://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html
Bubble Sort 冒泡排序
Selection Sort 选择排序
Insertion Sort 插入排序
Shell Sort 希尔排序
Merge Sort 归并排序
Quck Sort 快速排序
Bucket Sort http://www.cs.usfca.edu/~galles/visualization/BucketSort.html
Counting Sort http://www.cs.usfca.edu/~galles/visualization/CountingSort.html
Radix Sort http://www.cs.usfca.edu/~galles/visualization/RadixSort.html
堆数据结构
Heaps http://www.cs.usfca.edu/~galles/visualization/Heap.html
Binomial Queues
http://www.cs.usfca.edu/~galles/visualization/BinomialQueue.html
图 算法
Breadth-First Search http://www.cs.usfca.edu/~galles/visualization/BFS.html
Depth-First Search http://www.cs.usfca.edu/~galles/visualization/DFS.html
Connected Components
http://www.cs.usfca.edu/~galles/visualization/ConnectedComponent.html
Dijkstra Shortest Path
http://www.cs.usfca.edu/~galles/visualization/Dijkstra.html
Prim Minimum Cost Spanning Tree
http://www.cs.usfca.edu/~galles/visualization/Prim.html
Topological Sort 拓扑排序
http://www.cs.usfca.edu/~galles/visualization/flash.html
Floyd-Warshall 算法(解决任意两点间的最短路径的一种算法)
http://www.cs.usfca.edu/~galles/visualization/flash.html
基于Kruskal算法的最小生成树的构建
http://www.cs.usfca.edu/~galles/visualization/flash.html
动态编程*
计算 Fibonacci 数
http://www.cs.usfca.edu/~galles/visualization/java/visualization.html
其它
Disjoint Sets http://www.cs.usfca.edu/~galles/visualization/DisjointSets.html
Huffman Coding 哈夫曼编码
http://www.cs.usfca.edu/~galles/visualization/java/visualization.html
