![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
=>!!!DS and AA in C
文章平均质量分 76
b_end_an
这个作者很懒,什么都没留下…
展开
-
!!!Chapter 11 Amortized Analysis
11.1 An Unrelated Puzzle原创 2013-08-15 09:21:06 · 611 阅读 · 0 评论 -
!!!Chapter 10 Algorithm Design Techniques
10.1 Greedy AlgorithmsThere are three greedy algorithms in chapter 9: Dijkstra's, Prim's, and Kruskal's algorithms.In greedy algorithms, in each phase, a decision is made that appears to be good,原创 2013-05-31 21:53:14 · 903 阅读 · 0 评论 -
!!!Chapter 9 Graph Algorithm (9.1 ~ 9.3) Topological Sort/Shortest-Path
9.1 DefinitionBasic Component: A graph G = (V, E) consists of a set of vertices(顶点), V, and a set of edges, E. Each edgeis a pair (v, w), where v,w ∈ V。 Edges are sometimes referred to as arcs原创 2013-05-18 11:01:13 · 2693 阅读 · 0 评论 -
!!!Chapter 9 Graph Algorithm (9.4 ~ 9.7) Network Flow
9.4 Network Flow ProblemsSuppose we are given a directed graph G = (V, E) with edge capacities Cv,w. We have two vertices: s, which we call the source, and t, which is the sink. Through any edge(v,w原创 2013-05-30 11:22:38 · 517 阅读 · 0 评论 -
!!!Chapter 2 Algorithm Analysis
An algorithm is a clearly specified set of simple instructions to be followed to solve a problem.2.1 Mathematical BackgroundDefinitions:T(N) = O(f(N)) if there are positive constants c and n0原创 2013-04-09 20:28:38 · 570 阅读 · 0 评论 -
!!!Chapter 7 Sorting
7.2 Insertion Sortvoid InsertionSort( ElementType A[], int N ){ int j,p; ElementType Tmp; for( p = 1; p < N; p++ ) { Tmp = A[p]; // we compare A[j] & A[j-1], so j>原创 2013-05-05 22:50:20 · 1164 阅读 · 0 评论 -
!!!Chapter 6 Priority Queues (Heaps)
6.1 ModelA priority queue is a data structure that allows at least the following two operations: Insert, which does the obvious thing; and DeleteMin, which finds, returns, and removes the minimum el原创 2013-04-29 21:07:54 · 709 阅读 · 0 评论 -
!!!Chapter 8 The Disjoint Set ADT
Disjoint Set: 不相交集,并查集8.1 Equivalence RelationsA relation R is defined on a set S if for every pair of elements (a, b), a, b ∈ S, a R b is either true or false. If a R b is true, then we say tha原创 2013-05-14 23:10:35 · 2235 阅读 · 0 评论 -
!!!Chapter 5 Hashing
The implementation of hash table is frequently called hashing. Hashing is a technique used for performing insertions, deletions, and finds in constant average time.Tree operations like FindMin,原创 2013-04-24 02:33:51 · 647 阅读 · 0 评论 -
!!!Chapter 4 Trees ST/BT
4.5 Splay Trees(伸展树)Splay tree guarantees that any M consecutive tree operations starting from an empty tree take at most O(M logN). The guarantee does not preclude the possibility that any single o原创 2013-04-18 21:48:01 · 642 阅读 · 0 评论 -
!!!Chapter 4 Trees BST/AVLT
4.1 PreliminariesA tree is a collection of nodes. The collection can be empty; otherwise, a tree consists of a distinguished node r, called the root, and zero or more nonempty (sub)trees T1, T2,..原创 2013-04-15 21:53:37 · 8940 阅读 · 0 评论 -
!!!Chapter 3 Lists, Stacks, and Queues
3.1 Abstract Data TypesAn abstract Data Type(ADT) is a set of operations. Abstract data types are mathematical abstractions; nowhere in an ADT's definition is there any mention of how the set of ope原创 2013-04-11 21:02:19 · 777 阅读 · 0 评论 -
!!!Chapter 1 Introduction
1.2 Mathematics ReviewExponentshttp://baike.baidu.com/view/5711140.htmLogarithmshttp://en.wikipedia.org/wiki/LogarithmSeriesarithmetic series 等差数列:Sn=n(a1+an)/2geometric series 等比数原创 2013-04-08 21:27:22 · 465 阅读 · 0 评论 -
!!!Chapter 12 Advanced Data Structure and Implementation
12.2 Red Black TreeOperations on red black trees take O(logN) time in the worst case, and a careful nonrecursive implementation can be done relatively effortlessly.A red black tree is a binary sea原创 2013-08-15 09:28:00 · 732 阅读 · 0 评论