h ange E h ange E

XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
Recursive Tree Method
B

B
to

to
k

k
lic

lic
Saturday, January 10, 2026 1:29 PM
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 1
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 2
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 3
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 4
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
Master Method
B

B
to

to
k

k
lic

lic
Saturday, January 10, 2026 1:57 PM
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 2T(n/2) + n

KG Algorithms Page 1
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 4T(n/2) + n²

T(n) = 8T(n/2) + n³

KG Algorithms Page 2
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 4T(n/2) + n

T(n) = 8T(n/2) + n²

T(n) = 16T(n/2) + n³

KG Algorithms Page 3
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 2T(n/2) + n²

T(n) = 3T(n/2) + n²

T(n) = 4T(n/2) + n³

KG Algorithms Page 4
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 2T(n/2) + n log n

T(n) = 4T(n/2) + n² log n

T(n) = 8T(n/2) + n³ log² n

KG Algorithms Page 5
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 2T(n/2) + 1.3

T(n) = 3T(n/2) + 1.7

T(n) = T(n/2) + n

KG Algorithms Page 6
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
T(n) = T(n/2) + n
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = T(n − 1) + n

T(n) = T(n/2) + T(n/3) + n

T(n) = nT(n/2) + n

KG Algorithms Page 7
 h ange E hange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om

om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

T(n) = 2T(√n) + log n

T(n) = T(n/2) + T(n/4) + n

T(n) = 2T(n/2) + n / log n

T(n) = 3T(n/2) + log₂3

T(n) = 4T(n/2) + n² / log n

T(n) = 3T(n/3) + n / log n

KG Algorithms Page 8
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
Saturday, January 10, 2026 7:46 PM
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 1
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 2
 h ange E h ange E
XC di XC di
PD F- t F- t

PD
or

or
!

!
W

W
O

O
N

N
Y

Y
U

U
B

B
to

to
k

k
lic

lic
ww

ww
om
C

C
w c w c
.p
d f- x e. .p
d f- x e.
chang chang

KG Algorithms Page 3