Dssisnmen

Nneails HimmuD Lahune

BSCCS
al.nBS23220
Iokoduchion Baule Force end levide
andConqu et. methocl.
Deine he hetm AlA0ihm isk he Key chuta

An algoih is shep.byslhep poce due

Eormul Snluiny oioblem
Campleing tasles
ioihe numhen
picalhg eptecessed
wl1-defined instruchior

kes chatoctezicha oF an Aladtithm

Pioteness Must eminale 9fhe akinhe nombt

24DeEteness Each Shep shoudbe pEecisely deined

and unambious

Con als e 2.etD

Q Speciied set

4. output ptodu ees

01ehe

5EEectiveness Each Shep mus be busiss enougY

o be pesfmed
ime
0 2 s t but he Factot to mathernatica) Cinal4si5
ecotSive algozihm aith escurnple
Base Cuse The Goplesh ostance 6f he rtoe
which Slops ecUsion

Calculating factoia), FactorEi) (o)=1.

RecOtsie Case Hoo the pzoblen is devided tot

Srrulle Subptob1ems.
Factotía) Cn) nx factort ia ( o )
Retuence Relakion: A mathe îmalicau eguatium
le fines. the e turtSive alaotihhm
Fot fac ko"riul T in) T Cn-) + oC)

Time ComplesihAnal2es the nombe

opetalio
he hie Complexiky To fuctoiulis.

apace ComplestihEvnustes the mem0

sage especiallx due to unchion
Let: fuCtotial has 0 n ) Spuce Cornn esci
dwe o n neCurSive Colla
Tet migtioo Eosutes Ahak Fhe Gl9oritlom
emenhual)s eches the btse Case:
er fuchurial taill hetmiauke shen n t u h R S
3hat aee ho fundamensl5
asis olaotitbrni efficienc.
They Cte 1ime efftcien indicainging
Cand
Spaceeficiene iodeatinA how nuch
mernoS 0ses poblem
b0zinASeatchi ng n he Si2
patameet wil be he patoom
nals deg:tee 4he nombe
Coefficlents Ahich
by thtun ihs olesee
 n,slezi sTime
Cdistonte
75) C->D-A A+ß->
sotukign animal
4AIS)
3C32)
ies
shutking
Ss the o
uaivisited
cih closest echss3e
Ah cly epeat
Alaatithm neibhat Nenesh
one 3olve and
ptohle Senen Saleaueins 4bais
 is Conqyez methsdo.
deyide and

bgy pepae he meztgesto algoithn

toith Colyed eanple
Devi de ind Conquer me thedolegy
Salveg poblern h
into malle Ssh-ptDblerns
2 each ubgtoblern ecut Siue ly
Solu-ioo9

Meesott Alarith
o o s Usig Devide and Cangu e
Steps
Divide split arty into toso ha lues
Congueti Reruzsiel serk ach hol e
3Combine Meqe Sozed halveS
etaesot Excarmple
Sort s.223L6, 43

oivideCs.ad, 33 and C16, 43

2 Conquez s 2,2,31-> L235&1
Cu,G.43 -> CL, y, 63

Space Conplsito (n)

0.6Lanite Quiclkaer Alaoithmand 501ve
ecmple Talke praprtiake laa
OuicleA6hAlaoihn
Adivide- andConauet Sczing nlgaithrn
skeps
2 pattiian atou0pivob
Sub-aTS
Ouicle Sort Algoithro (oython)
des quicksozt Carzy)

quicl<BoTt (lef) t midle t quiclesazh

(zlghh)
Dcunple
az+ he aetoy E2, 9, L5, 2, AI
Soloion
chose pivots
2. poi}ion
-left
-mildle
C.7:Laihe binay ea ch alao-hm
Algoilhn
A fask Seo (h algpzith) or Eindingon
lemen
sheps
inibialise lo cnd bigh indecies
aCalcolate the midooint mid.
SComee he totaek element x i he the
midpoiak element
9 Reape steps 2-3 o l X is foñn oz Lo
high
Rinuy Seazch Algozithm (Dythen)
dep bingt Search (azE,X):

high a en (azz)-)
(ohile los <: hiqh
mid (1os Hhigh ) /2
Element founed

low=mjd tl # Seos th zight hatlE

else
high naid Sea Ch lef hal

Cind 4he index t S in the bort ted o

ime Compleoit 0(log n
Spate (omplesity 00)