propnties of

of an, flqoi thm

is a foile set ofof inshuct ons to
pa hculay task.
par
acomplitha
PInput; Zexo of morc
mOYe quanthes, ae ealtinally

luppled
deast on quanity is prodund.
g.Qutputi At
Definiteness: Each inSthu cion is cea and
3
ündmbiguou
FioiteresS : If wc trace out the iostucions
Of an alqoithm, thro for all cases, th alqoithm
teroinates after a ioik number of.
s Effec Feress: Evey insthuction must be
basic so that it can be Cayiied out, in

princple, by -
person uing only prncil and
aper. s not cnough that cach opuaton
be dafinfke also must be feastble.
tt an
algoithn to tina -the Jarqest
of N numbes
 lqoailm
I|-A is an
Mox(nn)
Result A1:
for i:zk ton do
if A]> Result tkn Reyult;ADT;
veunn Result ;
3. Discuws about tte
an performancs ,analyeis
algoithn oith enanmples:yysli i
of

|1Space comglroihy: "Tk amount of memory

amo9N

sequâicd by an alqoithn to sun to

Complihon
|a- Tine compkai ly.: The ameunt o Hme
vequired by,an, alqornthm Tun fo (omplli on
Exampe
lqoifhm Sum(o,n) n,s,i one word

fox i:=ton n do C 3
S?= S+a[i];
S(P) 5(sum)> na3
Yturn S;
3
 Tpltine Dlgoithm Complathy.
A measure of amount of data thatE
i t mut procs in
.mwt cficnl
osder to be effiient
called agolhm compleity
. aot
t thu steps in mathenati cal onalytr
lof ecuaive. adgoihms.

Define an, figoithm 2

2.:.Wite the, recusi ve, relation
2: Identi tg a cat
4 Solve recuYen ce Yrelaton

|s Analys e Ame complai ty

neede d
yali dak sith teating
l Wite ab out Te cursive algoithms
An alqoithmi
algoithrni is serurstve 1f an
is involke d by iself.

An dgojthn t4 is said' to be indect

eCursive ?f icalls another alqorith
whch o tuon calls algoithm A.
 Exampla
2- Gcp
3: Towns of
Y-
Hanoi.
Pemutatt on GervlDr
What s pseudocode? whu do wt' ned it?
PSeudocode is a method for ea preasing
the ceps an alqoi fhm in"
danguage -tndepndent 'and inforrmal mannu.
Its esniatly a Llucptnt for toihng
Co de,
altouwingdvdoprs
to plan. put, the
logte and sthucur of heir program
befoe diving intothes Somplexities, ,ot
actual co ding anguag
vitr Ard
3.beffne Spacei cormpluity What an 1ts
Com porents?
Spae Comfuaty The amounE "aenng
un to
 omponnt;otswn
Ftud pvt - indtpenianbof input
and output
noeded
part-s
vaniabliy obose Si3e
componant
othur pio blim inslance

Deine time compleaby

The am oun t o time rtqit d by aan
alaoi thn to un fo compuion"
tiow much tiné is icquted.o ilat
n What isthe signticanca of aumpate
lo.
hotaion

aqoi thrn analyis as ihproui da a

COhci se cw ay to de Oribe h tine o,s.
Spae cormplezi ty of alqorithm enabing
an d pre icibn bì thoa
Compaisons
7ting bagedoun inn cxact, detals.
how
It helps undestan ding
dlgoi hmg perfom as th input sie gtous.
 Evplain about th aumpoke nolaons
oith an
Biq Oh noiation (0)
The füncton f(o)olacn) if thereest
POyitive consBants c and ns sach that
f (n)s C* atn) for all n, nn

Th funetionn) gn)if these aäy!

postve tonstantcánd n, such th at
f)> c tatn) for all ni
Theta nolakon :()

positiver tons tants ci, dandong uch that

Littk oh obib sr t
the
im 9(n)
hoo fin)

framgs
Big Oh
fin)3tsn+(, 3(o),= n
fn)sc 9n) oy all n >mo

fon

H8Sns tru

This Ël| be tu for all nzl wn (=I4

So,
Big omuga
fln)= 3n?4sntb, 9(n)= nL

fn) > .G qn): for all n >no

 true h=3
true h-2
0pi nl.4cI9 for
then G-l4 C,=l, lit
g gln)< G
nzn6 all for lo) flhs
glo=n(i (n)n'tsnts, f
)en frue'itor
all is1his
(r
tru he4
a84
n=2
tue n:l fo,
3ntsntl thn C=l
3n+Sns
 the dunote Commornls
totuxd nofaiorn
is
ohBig in(maxs si3e input th a
et thm algori o resourte
th uage
nhmeagoihi the which an at rak the tonekns
compnity
of saymgoe
ls)àio(n|)
eriky Asqroploie by
Ïmeant
iy o(nognisWhat
I
n’o5043o so,
im
n
fen n
im
omega- Lit e
ho
nt
n2 /n) n+, 9 (n) Herf e
fin) lim
o oh
stte
 s an etficient sotHing
ahoiltn thet has a compuily o Dh toy)
) Makix mulligpliatiorn has acomplej ty
o O), where n is the si3e of ti
tnahies
Ymutalion ganrator th r gNen set o
elamens is on), n is number of elineny
13
Find Big 0wotation fo the folouing funtin
fin) 31+Sts!

qiven f(n) s015t

Fov 0|)olGs (falseieolrils

3n+snt: Oiny danot bölds:lgoyd

trug oitaari
h2 te
h=3 48s|23
 This fo al n21 when (- l4,
.32 4 Snt6 = On)nt)

.Ucing siep count And te

th tima complit
of Sun of 'o' naural numbs

Algotthm Sun (n)

for i=1, to n do I| ntI, times

3
Tire compliby is nt timeg.
I5. Explain th rolk dF înstane charactotttck
in -finding te timt| and space
Conplbikes
oith an exampl.inieip
Tnstane characteisties plays a Crucial vole
fn dekeniningte time and space
Compui hu of an alqoithm
Chavact: Ha inude th S3oth
the valws of inpu eements and
ianymput,
othex properties, specihe instance bing solbed.
Otter
 Alqoithm Sum (aun)
foy it=l to n do lnl limas

euin s; ire
Spaca (omglrity D,5 one oideach
nads nwody
anay t
a is an amau
) s() 0t3
an+3 ints
Tine cormpaky
li. Explain bitfly te Tine cornpleiy eslimaton,
comploity extimaton and th fradyof
Space
betuxen tins and,spac,comp9:
conplety Esfimaionna hc H
Time
how the runtime of, an ahorhn
It prdick
ate input sze incaeA, typicaly
qvows
aJing r3ig0 notaion
Cornplesoty Eslirmation nlt
Àional memory an
quires
atqorithm
Time-Space tradioft
BaBaning act ohee opliriging fo n
of to involve sacn ficdg the otker,. and
vice vevsa. Achieving impvoverens in one
aBpel- ually Comes'át thi tupen of
ond constraints

Discuss te time compleity anlyis of

MCMY¥Ve factotel alqontim
T

Alqpiin RFactoial (n)

if(n=) then /tie
1

T[n)=|+l+n-1 tn-l
L8.
ecursive AincHon to compw
the Gc
oo qven
ormp laity
lgoithrn RGco (a,b)o s2

3
etunn RGCo (b7.a, a

Yeturn L:
3
Explanaton
"In each recuive caü, the
fundton rrpla
the darqer
number slh t reman der oe
18 division y the smaller number

-the inpus
So
time complna by is O(tog (imin a,s)
 Deseribe te pseudo code conven Hond tor
Spe itying lgorithm of ve cursi ve, and
an iteralve alqoithm -to rompuke
Algotam Focth)i Algoithm RFactn)
if (n=) ten
foy i:=n to| sep do tusnl;

rchum f;
sun ntRFack(o-);

Blocts :.indic at d coith,mathing braas Sand?

3 Assiqhrent: (vaniabli) :: (oxprsion);

boops for loop ohich uns trorn ntoll step s -
S Condilional slatients: floniHón ) ns)

3
 20. White'
any tuo Feponunliad fpouth
Funchon.
Reciusive Fxponntil Gooth
Reave alqoithm ike nave recunsive
Tpltrrn tations o Fibonact er factortol
Calautationg eihibit taporatial growth.
toch tcusive call may in mulkple
Subsequrnt cals, Juading to e*porn tal
Jrowsth in the number ot functon cally
toith vespct to the ioput stge. uoh
Ezponuniad Tirne Cormplni ky in Tloañve alaoil
nItotivc alqoi tens suckas exhauhve' search
th algorithros, ike bnuke- fore sub set. sum, (an
also camothatt exponen tial tie compirdty.
ildirv)
Thex alqoritkns invcve erploing all posibe
tormbinaliny or'permuleti ong tiling to
a rom bing toicl explosfon, of.itaton a
the input ize incaus.

24. Fzplain about fArnosized'Anàlit

" Tt
tt is ukd for alqori thms ohe an

oc Casional operahon 15 vey slow, but

mot of th other operatioytiong ae faykes.
 Sciende to analyze th avenage -(ax, "
of algot tvms
hms that prtosn
a sequne o operaions, ohere sorne
expnsive"than
Opr atonN may
othes.
JAggegae
Method
-Anai d
Analyets Potental
Method

Aecouning
Mthod

2. In ohat way amoizd analyie is wd

usrd
for
perfosnanca analyis okof algotm Fylain,
-Amostizd analyis is a method uscd to
urndastand the avesagu tirne complraty of
a Stqunce of opnatian in algofthms.
It hedpe in iaenhhjing eutiy opafisng
asigring costs to operatons, and anaying
thiir aggat Cost to detomine the
aviage Hne complity per opsaton.
que
This technique is especially voulu oble
fov algoitkms tmucling ainante dala
shuctuJ,
Rong- Arim
piouding
fo mance, fhren
on indivual
than toceurg tolely
Operation

b Homr

ailsn