H

An algothm $ a ffnite det of frethuctons tbat

Algorth:
loueed, acomptts hes a putular tah
pngram: A proqtam s fnsttions for a tomputer to exeute
Spectfic tasks

Dffeence betueen Atqorithm and pngTam:

Agorithm pnqram
At Destan fme
nt fmplementaton tfme
Oomaln Khoustedg + Develepers
>pingramming lanquags
language CCtt java,cte.
Softuunre and Hdeare softnye and tHardare
1ndeperdent. dependent
Analyss ( tfme ¢ Space)

Charactey (sttes ;

iny algonfthm must satisfy 5 chaacteistics

Tnput: O or moTe quaniHes are extenally Supplied
Outputi ateast one auantíty s pduced.
3> Deftnatenes: each nstucton ts cear and ana mbiqous.

algortthm,
Finateness : f t ace ut of fnstnction 0f. an
s

then -for all cases the alaorfthms termfnate ofter

a fnate mo
of steps
b Efectfve nesSs Dort wsfte nneSRÍE UnnecessaY instruction
 2qlosl2y
Tíme tken by an alqorfthm:
Tine taken by an alqoitm u koun basiqníng
4
unit of tine for eoch Staterment andit statement is repeafiy
-for Some noof times the freuency of statement or ezecutio
0f that staterment uwtl be calcealated.

Ahoithm Sum(A,n)

S-I
S=StAti] –n
A-n
Yeturn S,
20

Alqorithm Add (A,8,n)

for (i=0; (<n; itt)

sfor (ý=o;j<n,jtt) nn+)ån B-n

 B,n)
slqoithm tral (A,

n
for lzo; íen; Îtt)
(

n
for (je0;jen,itt) nxn)

K-1
tor(Kso Ken; Ktt)nnintl) hT

3n+u

for(izo, j<nsitt)

Stmt;
for (i=0, i<n; itt)

tor (io í70; for (ý=0; j<i, jt)r (nto

tmt, stmt;

for (=o, fen, it2) nntt

stnt
J
ereruhior
nofhmes
for (iso; eny =20)
Strt: tqr)
 2olol2y

for (t=1 Pen, itt)

+213
It2t3ty
p-P+i;
{+23t.

P kk4)

Ke Jn

-for li=1; ien; f= îir)

2

Stnt;

Jtmt;
for (fe o, trien,tt)
stmt;
J

for(?=, fen, i-in2)-'3

Stmt

forCjeo;jenijtt)
Stmt
Stmts

>forl izo, i<n;it1)

tor (j=1; 3en;i=r)n tog

foy (i=0o; len; iit) -,
o(n)
stmts i|; i--)
lo9 for (lan;
o(6)
for(i=1; (<n,i=ira)

for (ie,i<n; iix3)

 ble (ien)
Strnt;

while (rnn)

12
else
=p-n,

Algo testh

(nes)

pirtf
(orditon intutru
(vd', n) -
else 2+2
Condtintalse in

-Ayeise
tsutd

I<logn<sh<n<nlogn<ntz...<
(îrementa) ordea ot ttme complesity
tfme
 n
10qn

2.

2
3 64 a56
8| 5|2

05loql24
ASmptotic Notaions!
Asqmptotie Notaions are used to shouw the clas, of a function.
we have 3 NOtalioms
Big ob

)Theta
+ 1f we
fnda
TÍme function of anyalgoithm then
it to
be among any one of these or muHtple of those.
If t (s m0t a multfple of those theH we mnay notbe
able to Specify the Theta motation, we use
the
Omega notatton.
Biq oh notaion:
The functon f ch) =
Oqn ff3 tve onstant. cgn
Such ttat
need to chouse mearest

2n 19
2n+3 ( Upper bound

20+3< 2nt3)

O
Omega totation ():
The
funton fen) =ngn 1bb tv2 constant ce

2n+3>n

Theta

The funtfon fege

eq
Qcn)
Such that en9
ibt 4g ve const c,,G4n

Jn<2nt3

fo=2t3nt4
Biy oh

Otrty
Theta:

<
in 2nt3nty e
2ntn
 neilogn)

General propeslies. 0gloql24

Reflexive propety
t
fCn ls gtven then fn)
=0 (4c) 0tA3
Transttive propety:

*If fcn is Otqn)and go ts 0 Cbs) then

fc= (hin)

t fco) e(qen)) the

Transpose Symnetic
(qem) hen
O
qn=un (-fen

tf fcm Dten) dnd dh) =0(ecn) then fem +den=

Dcqc) dero=0(eco) ttben

Dff= and
is ti8
fCmA dcn)• 0(gn) * ecn> ) on0(prod (qcm,ecn)
 Cmpartsion of tao functlon or classes

urth
Samples' loqn (toqn°)
wth
loq ialogn< Blogn

Divide ond conaues

DAC (P)

f( Small ())

else
Divtde P in to p,, PK S
PACCP)
coTndne (DACCPD,... -
Dht (P)

It fs a shterqy for Sd Víng a problem.

problem. It fo a probem some
Ske lsqiven and it 3ays that problen ts larqe
and then we
dvide tto Sub prodlems
al may as possible,
h,fa..- Pk and these Sub problens ahe Solve to 0btaun
thur
Solution sS.-.. SK then
(eonobfoé tolget solutton for
the main problem.
even
tthe sub problern ts larqApply divde and onayut
s
"The conotraunts
ast.
> whatever the
fs the Subproblerm must be Same
problen (5
as main
a we shousd have some method or ptes to combine t
Sub soticrs to ot solutfon or main prpbln
 we
The pivtde Conuer Strateqy tsecursive nature, shod
&

unton and tinding

Kncw bous to eofte Tecurtie Algottbuncf
ttme compleity, hou to analyse them for al! these e use
çecursence relaton

Votd test ( Int n

ftn>o)

Test(n) ;

Tyee mthod:
TC3) "(n) Vod Test (fotn

TC2)

nt 2

Tco)
test(o-1);

Ten

TCnt0tI
= TCn-2)+)
Substttution method:
T UD)= TCN-Ut|
=(T(n-29t)t|
Ttn-2)t2
lT(3)+1J+2 TCn)T(n-ntn
TCn-8)+3

k term
Ten
eee

T(ote)K On
 void Test (Ent n

-
2

-for (ico; ien;it nt!

Tree nelhod!

Test (o-1) T(n)

TO)=1(n-1)+nTeUsíon n

Substttt or method:

=
T(n-))tn-tn

Kterms

T(et(n-(K--)+ tn-(e-2)) Ttn) =0n)

#ssume

T
T(O-n) +( n-nt) + (o-nt2)t

nnt)
 vold Test ( int n)TS)

Test
(n-)} -1(0-1)

Tyee ethod;
--lon
Ten)

logina) T(o-3)

1(2)

105

1lo)

ogt og
tn19tlo (n-)+ logln3)
ogtloqt)+ toq to)

nlogn
 TO) = T(O
tlogb o(nogn)

TM Tn-2) 0tn)
T0)T(n-50)+n
0cn
Alyutbm:
Tiee melhad:
Test(nt n)

t(0) 21(n-1)+ 2
-21(n-)+1
1t242+
Sum of Gip tevms KH
2
 ovem for decveasnq funtions
Masters the
TCn= aTCn-b)t ftns

0(n*fcon)
3) 16 as10 (nab
0(ftos ab)

Alqothm:
Test (n

Pt ("%d n);-1
Test (na) T(DI;) 7 )

} 1(=TOh) t2
=1(n})+1

Ten+n=
 hejbolo

|<4

ASL
(i)l.-(lu)

(-lu)L

cuboru)o
Mastes heovtm for dlvidna funcfons.
TO) =
aT(n/b) +ftn

ttere we
derfve tuwo
terms

* K

aa, b2 a-8, b=2 ,K=l, P=o

K=l

tog
loq= = 2

Ke |

2 >|
CAse : 1f loq a k then

* it p>-tthen (roq")

*f p:-t then (loq

(otog logn)
* f p<-t then (n)

iogh
a=2 b=
Kel P:o ar2, b2 Ke Lp*-1

Vb og,nlo5e
P

K
loqg- loq
Joga

P+!
Pz then (nloglogp)
o(ntoqogn)

(3 Tn)=T(n2)t

a2, b
2, Kel,P:-2

Doq- togi-l

Pe- then 9(nk)

case
3: H loa<kthen
P20 then e(noq)
* # pKo then On)

Log 0 <2

Alqoithm:
Testco Tin)

S
trnt, |

Test(sn)) T(Un)

T(2.1(n)K
7
 !
Binary &eavcb

62
3
214 5 29 3||36 2 453/b5
13 1y 15
2 3 S 8

Key|2!
mid
12
15 ItIS
( Key<nid)
( 5)

Key= 80:

Yatd=
th 2 eey mid
15 It15 (30>q)
5 9415
2 (36 <4)
he mid

2 (30< 36)
qtgq (30< 31)

5
element not founc.

Key =y2:

rmid= Lth

15

t)

igonithro!

Binanydanch (A,n,Key)

while c5)
 mtdr lth
H(Eeyz A[mid))
Yetun mid;
fCKey< Atmid])
hemd-1,
Key A CmtdJ)
l= midt

retun o

Recunsive!
RBfnseanch ( L,h,Key)
10)
ef(a==b)

eturn l;
e lse
return 0;

else

mtdz ( th/2
=
4(Key> A
[mid]) -1
retusn mid;
t+ (Key<A[mid)
setusn RBinscench(1, mid-l Key
T()
else
return RBnSearcb(mkdtl, b,key; Tn,)

Yeturn o)
 Tloql241
uick sort:
2

12 15 3 16

6
I0>3
I015
16

5 105

<pívot > pivot

Partsion (e,h T
Alqonttbm ufckSort (h
pfvot AJ

while Ci < partton (,b)

J=
-
Tinb) uiek Sort (j)
do Qufck SoTt (it,h)

whtle (AC] Pivot);

do

Í--;
}uhile (A3J>pivot);

Suap (Art3,AD;
Swap (A(3, plvot);

o(nlogn
hericseogn 30 loql2y

Nqlo nulat in (a,B,n)

-for (feo;ten;
it) tl

or
(K-o; K<n;kt)-1xtn

fim-on)
br bin Cn

ba b2)
 Alqo n
mm[A,B, -TO
1f (ng2)

formulas

else

mid = ;

mm (Bun|)t mm (Aj2) B21 n2 Tn Toe).

mm (A, Bi2n/)t mm ( B2 2, Ol2)
t

mm (ABu,TD2)+ mm (2 B2 D1)
mm (A2) B2 "2)t mm ( A22
B2 D½)

Formulas:
p=AntA1)ButBa2)
Q- (A1t Aa2) (B)

S
A,(BA- B)
T= (Aut Ai2)(Bs)
U= (Aa -An)(B,+64)
V= (A2 -A22) (B.,+ B22)
 Cin
PtS-T+V

C)= tstS
C2n P+R-Qte

1
TCN)=

2 b22, Ke 2

b toq
2.81
fc)= 0Cn)