(O(n

(O(n

(O(1

(O(1

(O(n

(O(n*Lg n

(O(1

(O(1

(O(Lg n

(O(m+n

(O(Lg n

(O(n

(O(m+n
(O(m*Lg n

(O(n

(O(Lg n

(O(n

-
'.

(O(n

(O(n

(O(n*h

2-3-4

(O(n*Lg n

(O(n*Lg n

(O(n

(O(n

) (

m,n

(O(1

(O(1
(O(n

2


n+1

, =
:

.

(O(n

' (O(Lg n

(O(Lg n

(O(h

(O(1

)O(m*hn
(O(n+m

(O(h

2
(O(h

(O(h
(O(Lg n

(O(1

~O(Lg
(n

(O(Lg n

((O(Lg (n+m

(O(Lg n

.InOrder
(h=O(n
2 - inorder
, , .
. .
:
/
.
.

(O(Lg n

(O(Lg n

(O(m*Lg n
(O(n+m

(O(Lg n

(O(Lg n

,
,
,

(O(Lg n

(O(Lg n

(O(m*Lg n
(O(n+m

(O(Lg n

(O(Lg n

(O(Lg n

.
. .
.
(O(1

(O(L
)O(L*Q
(O(L*Lg Q
(O(t*Logt n

2-3-4
2t-t

(O(L
)O(L*Q
(O(L*Lg Q
(O(t*Logt n

(O(L
)O(L*Q
(O(L*Lg Q
(O(t*Logt n

: P .
(O(P
TRIE
,
Q . L .
(O(P
3

(O(P)*Lg(Q
O(m*t*Logt
(O(Logt n
O(Logt
)O(n*t*Logt n
:B-Tree
(O(n
(n
(n

(O(n+m
K P : , ,p+y .(((O(p+ y*(Log(p+y :.O(p+y) :
K : )( . (k + Log(n+k :N .(O(n :
,M>>N . m*hn ,(m=O(n inorder , ,merge .(O(m+n .
:POST, PRE, IN ORDER .(O(n -
n < n*Lg n < n < 2^n < n! < n^n> Log n < n^ /
n*Lg n

Max

(O(n

Bubble

(O(n

Insertion

(O(n

MergeSo
rt

Heap
Sort

(O(n*Lg n

(O(n*Lg n

(O(n*Lg n

. 2-
3-4

"

.
k.

(O(n
(O(k-
k

(O(n

(O(n

n
c
n
c
n
c

(O(n

(O(k*n

nk-0

Bucket
Sort

Quick
Sort

(O(n

(O(v+e
(O(v2

V
V

(O(n*Lg n

.
.
.
.

(O(n
) (

(O(n

.
.

(Max(n,m
.n*Lgn

n-
.
.
Pivot ,
2 " .
" p .
BFS

. .

.

Lgn n*Lg
n

" n*Lg n
,
(O(n

DFS

. PreOrder, InOrder, PostOrder.

, :.
BFS/DFS . BFS/DFS ,
.
:d:f , . 2 :
V )(
[ ] ( ) . ]) ([
V ) .V " .(Scc

)- ,-


.

)( , ,
d,f
: ,- , - .

* : ) (** , " ** . **
/ ** + ' '0 : .1 : : .2 . : .3 :
.4 . : , . n-1= ** : X ,DFS - X) Y -( Y ,
- X DFS. :GT- . ,(O(V2 " (O(V+E <- ".... : )"(.
: . : ,DFS " ) f( . -u ,-v (f(u)>f(v " .
(O(v+e (O(v2 * (Scc ) : . Scc - 2 - . DFS .1 : .G, 2 GT, 3. DFS GT
) ( f ) ** .(G./ = A B.
) :(MST , ) -( , ) BFS DFS( . ).
- 2 ( )
a<b<c :c<a+b).Prime e*Lg v :/ .1 . .2 .3 . n- .2
1 . : ,(O(v2 . 1 ,v*Lg v 2 ** .e*Lg v . ::
) .e*Lg e )O 1 .2 . Find : ) ( , " ) .Union
, -( ** )<- ( .(O(e*Lg v
, . :Union Find. : , , .
Lg n. Find Lg n. Union , (O(1 . 1- .
: : . " . .1 : : .DFS. 2
.3 . U ? DFS ,U .4 . ? :
" DFS d ) DFS( ." post order DFS Low d
)( . V : V DFS Low )( .(d(V - V .
V . E A B : Low B )( .(d(A

: 2 , . k . . .(O(k : .
. : n m
. .k : 2- ) 0,1,2,4,8 ( k .
.k" (O(Lg m . 2 : . . : ,(m=O(n .(O(n+m)=O(n n>>m
m .n .(O(m*Lg n : k n . :
) ((O(n . . . 2 .(O(Lg k
..." . (O(k*Lg k (O(k. n : m . ) .(50% : .(O(n .
.(O(n : n2 n . : ) ((O(n n
. : m ? : n .m n>>m
m .((n, O(m*Lg(n n~m n<m .(O(m+n , : m ? : n .m
n>>m m .n n~m m .((O(m+Lg(m+n : : (O(n+k
(x=range(a,b (O(1 .a-b : , .
n : k , . : .1 : n+k. :
.1 : ,(k=O(n .n+k)*Lg (n+k). 3) : ,k<<n k.k*Lg k + n + k : : n
.3 k.k+n+k :
. " . : . n . 2 : ,2-3-4
t1<x<t2 . .log n- : .1 . :(h(t2)>h(t1 . t1
.t2. 2 : (h(t2)<h(t1" , . : n Lgn ) ( . : / lg n
) ( (lg(lg n ." .((O(n*Lg(Lg n inorder .(O(n- : k
2 ) K ( " z . : )" ,((O(n
" , : 2 , k ." . (O(k*Lg k*2 , z
2 (O(Lg k*2 2 ' ." .(O(z*Lg z .(O(k*Lg k + z*Lg z : :
, : k- .inorder : PostOrder -
) I ( . , . :k- : I .1+ >I .
I- .(O(Lgn : . : , n/4,3n/4 .
) . 2-3-4 ; - (. : 2-3-4 :
, " (O(n : 2 ) (2-3-4 / n , . : inOrder )*2
((O(n , ,(O(n- . ) .O(n : 2 ) LCS-Longest ,
-Common Subsequence " 2n ( : . : An=Bn
LCS(a1..n-1,b1..n-1)+1 (AnBnLCS(a1..n,b1..n-1 . , , Aj=Bi
,1+ / * " 2 **. LCS ,
0-. : , " " ) (Gscc ,
. G- . : G ) DFS ( .
) , - , -( . Scc )G ( , ) GSCC"(
. : ) ( A ,B A B.
: Scc (O(v+e A B . :
A : BFS GSCC ,A , . : ) ( .
A ) A ( : Scc A** .
, .Scc : , , .
A .B : " " A .B ) (B A B.
{{(MaxWight={i=t:0,Vj(ViVj)E: max{MaxWight(Vj)+w(ViVj : s t " . : , ,
.0- t ) t : t (t = 1
t s s . : ,1-10 :
.BFS: . A B C BFS : A C, BFS B C BFS A B
.(O(V+E .: A B : ) ( .
: .: postorder .
: (I,j,i<k<j):Min(M(I,k)+M(k+1,j)+P i-1*Pk*Pj )::" (O(n3: c*c :
c .c
. : , ,n ,K m . .(O(n/m + Lgm :
m- / .. : .
y . : / . : n- ) ( k
(O(k . : k1 . k1 .
k1 . ." ..(O(k+n:
k " n . .1 : k" . 2 .O(n*Lg k).2
" . (O(n*Lg k : . . . 2 : /
.. : . I j .v : ) ,
(.: k : )(
.