Comp2521 notes PDF

Preview

Summary

Written by Luka Kerr on June 9, 20181. Swap the head and tail pointers, and set current to the new head2. Untill current isn’t NULL, swap next and previous values, and reset current tothe new current->next (current->prev)####### /*####### L: NULL<-1-><-2->&a...

Description

O(n2) O(n l og(n))

O(n 2)

O(n 2)

O(n) O(n2)

O(n3/2 ) O (n 4/3) O( n2)

O( n log( n)) O(n2)

< O(l og(n))

O (n)

>

O(l og(n))

O(log2 (n)) O(lo g3(n)) O (log4 ( n))

O(log2 (n))

V E

E

e e

V (V − 1) 2

v v v

K5

E

w v w

w e

v

w

w

v v v

O(1) O(E) O(E) O(log(E))

w

w

V ×V

O(V 2 ) O(1) O(1)

O(V ) O(1) O (E)

∞ v

u u →v

u v v v

u

dep th = fl oor ( log2 (n) ) + 1

O(log(n)) O(log(n ))

i i i

2i 2i + 1 i/2

n

O(1) O (n)

O(1) O(n)

fu ll slo ts allslots

0.5 × (1 +

1 ) 1 −α

0.5 × (1 +

1 ) (1 − α)2

α=

h = hash() inc = hash 2()

T

P T

P

P O (nm )

T

n

m

O(nm + s)

s P

P T [i]

c

T T [i] = c c

P P

P[0]

P

P −1 Σ = a, b, c, d P =

T[i + 1]

Σ

P

O(m + n) j

P[0..j]

P [1 .. j ]

F (j) P [1..j ] P= j Pj F(j)

P [0..j]

O (d)

d

🔒

O(n + dlog (d)) d

t

f

n

...