are

In
he the
mokinq already
ser
ted) array. changed
builds the Fírst until Seot
For
the space in
the
1] H] u] ,64 64] 64
1|,64]
l, oY
partialty sorted the theyJiepeated thennt
hat implemen posihon 12,22, Il, as,
is of with that 22, 6t, 11 12, 25, l,
element if
thm partmake one 64, 24, 22,
atime is Lt them
algorithm se 64, 12, 12, 12, 29, 1, a1,
Sorted corrcctarray
11 64 is Loi
2, ’2, z,
algori and 2, compare second
sci
first to
2 11|
22|
25642 12< list
6waps
other [25,25, 25, 325,
the right 12, and
at fanddota
Sorhng the entire L64,
25, and Sorting the he ed inchong 9
item unders element(assumethe 1R<25 Swap
m
the 3wap5w
ap
them
withthe and through them tham
SwaP
and
Soxted
laray
No.4he
all into (25) ’1R5|6+22||| Hhen themSwap
swap
them
swap them n
hem Swap posiio
the element,
i2) positien
Simple
one Sm to Since elcments,
simple I1
to cicment clementuntill arroy element
25 them
wap
64
pass
are
latger 2.,
I2,
elements ee with 12,
2
array CassyFor 25 Is
clement correct 2a,
u correct
a Second element
curent
he the then The a5 12 2, , d and and
ond
"Compare64
i5 choice current ent ccss oe secoe 3 and
(consider
ais adjacent
s element Iist64,
Sorted.
ilist 25,
and and and
an
Second
2Pass
the
final
Sorted consider S and the ip 25 a5
order.25
’Sort Sort
Inserhion is lorget Curr pro aim
64
(t orde
Uorngpare (2s
3.Third
Pass
Pass:
First
1 6+ 64
array tthe "25comes
bearfay
smaller
is Compare
Compare
Ribhiesort First Compare64
agorithm Start and
25 aray
tbecome
s Sort
Bubbie oF Compare Compore
qooc ’Alqoritm the paxtthe
the Soried > Com Now, NOWS
(k4).
elerment pass witn comoares
hon with the Let's the fien Explanation
ia Given
Tnser a Soried Compore Lnscrt RepeatExample:pass Compave esi .
The Start Move Second i2
Suwap
IF
t "First
1- 2 3. T 5 alqorithm
hat and to the
according and to
maAdesending
the elcment Sorting
array pivot elements
algoritnm arfay lelfs on recursively
partitioninq.
gbuilds
moximum
a child the the are
as1 conquer arroys
build thne tthatthe SoYted
(For and &
Fatner Gr from
than
pivot (215
24JBal2
greater
rng - From algorithm
sorhto heaphe heaps heap Sub recursively suchon
and-element element)
greater tthe by I
structureextrocis
bosed in divide tuo clement are Created 34 array
slz|21
min heap array than
elcment delcte
25 pivot (any The
the Min 2s into
insert Sort Pivet
- or a"pivotor sorted
efficient greater 24
3icrn 0rder) from
repeatediy Delcting than
elements pivot the the arrays
dala quick say
ri chi
ld > 1Step
compa clement Step5 ten a Rearrangethenelemenis lct Element
lezs
then
heap0scending selectingcss
anottier the sub-
heap y otther Choose right plvot,
are less
then nce
a binary fothe max Apply
minimum is the thesub-array tthe Subarray
Sortis and Sort
Quick
by
> Sort titoning
tthey
Pivot:Partitioning Select Step)+
Recursion
Sort (forheop 15|9|25
Stepi
insert
lo 15
inseri works Alqorithm Recursion
Osder) heapHa s
HeapHeap auses
heap ttier
&3 (or) insert Stept
insert -Quick whe Select Example
par Siepl Step2
It
Erample
1o
Ans Step
2 33iep 1 R
Functons complexity
case
time will
treegsT) Hence
pOssible
space alqorithm's alqorithm tain Seofch
have number
BiqO, algorithm maun black.
cither binary
or mathemathical time search cannot
infrnity to is Some
fime
an are 9(
Fn) on is FolleuwedtF kbiac hode)
case thmeSiz¬ binarytrece node we
the of notahons an compleaty contain
on. are aof
S
beunds ime -best e black biack chd
leaf,
pressing approache functi balancing node
OF Size oF input in are
Conngiexity nocderuiesdeleions considered node
termslouser 0symptehc wo
oF hmeinput or ameunt Complexity
lintar thme
black
red
is nut lcaf a
amount
input bound oF Sesf- de a
to
or running
of thm he
unnina cochtain casC or ia Dull top leof
of Size
bound size funchon aas red biack
o
icaf
in and time algcriminimum time Fast of cer and Red-BiackTree are fo red therode
ay
algorithmput used
of
maximum lower type becouse ovst either ldren ( to
area upper Funciona thethe (2)
Notanon
Omeqa as andhert's nodes)
aluays of leaf Form root
in upper hasmeangaitth
linearly
groas an 0 ahas least a blac,
inserhe colored NIL chi Parent red
the commoniy
The1a
and
Omega, is black properties formnodep
black
OF
nolations
-Hsympotche (o): alqorithm
of
on
algorithm theOf theas
alqorithm Tree is The
Every
pathbering
nolotens at
an as Big the the a
Notation
O O(n),It Complexity
Represents qrs Tree Red-or
black duringreduce node(Null or
’ patth
Describe any heiqt ypvoper
describe a
of performance Representsas toke
witl Black red of 1. is
Colera
Node rmal
Inte
b1 temal
Compiexity .The Describe Example, balance Properthesode root leavesBlack
-Poymptotic
most
an hme
an Red-namecolored also
Ex
Alorngtwo Every
taskeExample, Patn
"They IF OE Tf Red tree EachThe All Red- 2
.AIt 9t
3
- " 2 3.
enough divides
desiancd follod, precisely machine
fangc
1akinq Sorfed lo]
contt afeipe) [319G2l
like
and the Simple
a
hat nalves. single R14B39e26
rules
tosk bu t be o to algorithm
tond Solution not a 1o
Ii's resuls be or ble produce
Finish unders in weil, rmusi person Sort two a 82, and
of hcular
pa ingredients must applica produce 9,
preblem ses
porticular and forever olgorithm recursively
sorting into 3a)27|43]
to or m resoufces Fined thima Situqtiors halF 3,
c operfocm start answer proble be to 27,43,
a prOcedure easy (ike algori array to
Sclvegct ps
ste confusion
no
with the
de cut
byY
conquerhalves eacnhoves [38 Splt
clear informathon usly an should ,halves L3e, array
be
he
the
or or
ied halves
to to
Step ciem
prob a
he
must OF uniambigus
in Carrico
trbe and- Sorted
the
Sort Soried
urisor sA
Stepsnsiruction solvetime thmprobiems merge
siep-by-
hove follouoing to you
onwotk step
step tuo Sorted array
array.
Recursivcly entire two subarray
Cinally.Combine
the
Siep algcts -diuide
cF must take5 qives should
much Each into the the into the
m
proble and Every the
set
specific
ia a
specific keep Each
An OF arrayand
tern
rmerges Divide Merge consider the array apply
T
Characteristics It Tt to0 Definiteness a with
iS a
I 7Effecthveness
Sieps Steps Generality Sort is
-"Merge :Conque
-Algorithm3 Step
Tnitial Recursively
thm aschve ’ 4 Sort inpur
the Oivide: the Conguer:
aigpithm
recipe Tnput Output
EFficient
Merge Example
3- Start Split
oigts
.Merge Let's Divide Merge:
Hnite Clear array
Pn a Hn 6 1 2
1 3 4 5 "
unsorted
cafediy
unsorted
enL fhe the of 11
ia
ch
Tnserton
) +T(na) rep
eiemnent edSort
find
at
hat the cicnet is t,whi
par
minimum
to and
array
ing,T(nj4)
fhmFrom Firsi ariay 11]
(Ceun Sorted 22,
algori the
clement the cntire 12, uSsorted 647
Tn)
retatena) fhc the 22, 226t a]
u:251:
ith as of wth the 25,
) thing the 64, element
(64)
First12,
Delctorn) lorgest)part
it
unsorfed part
cicment ciement betwcen a0]
Fnalysis
ond n
Design Asympoie
T(n-)
preperies
ties Approach sor Suaps unhu array the 25,
Aprithm Simple unsorted ín 1J
a)
SotSor4 Proper (or ,
Tne Tnserhien (Insertion Smaliest
and theboundary
minimum
proccss element
22, a0)
Cuick 1ree
5inary Probienrecdy
Seiection
Actiuity First part
unsortcdriqhi the
fersics its its ree
Poth
Snertest
Singie
a
arraythc
oF
beg1ning element 12,
consider miimum
[64,25,
become a[e]
Reiahon andneorem
u Master Prim's (5 the the the
) Usng the
Charnc Treeheapneap Sparning
|
Dykstra'
9 s Sort SOrt ihe the
"Selccthon the
with Traversethe
Repeat
5
the to wrth arroy
SortSori ial Tree
BlackFibtenaci Skip
list kruskal's
knapsack Algorithm minium
Qlaorinn(
ence BinomB- Minimum hreedy Seiects
cf
"Sciection Start Swap Mtve part Example
Let's Ficst
passthe Il
RecurrHeapMerae pari SwapThe
Red Jnit-3 Find
Jnit-1 Unit2
3 4 3 O ) 9 1 2 3 4
5 .
 Exsmgle Les's Coneidee 0 Simgie algori fhm fo fnd he sunt of too numbers 3) Theta Notahon (o)
Algorithn 16, 14, lo, 8. 7, 9,J.L, 4, 1 Exaaple oroot
Represents botth the upper and louoer bounds, prouiding a
perFor mance. 1 Build Max heap(A) 6(n)
Pseudo code tignt bound on the algorithm
Unit
Fooyd worshalr Angriih expected time complexity < For (e A.iength deugn th2 (n
45trt Describes the average or
N-Cueens rbiem 1 Input the first number (num
1) 3 Echange A]aim A)
Solesman Probien (hum2) "Erample
time Complexity
8 Troveting 3 Tnput the Second umber thm has a
4 A heup SiLe - A hea psiat
Approach, Ifan alaori running time
Compore bl reedy pregramng 4 Aad num1 ond num2 means the lincar 5 Max heapify (A,)
Cnquet ond dnamic OF G(n) , I4 Some rate as a I,14, 19,8,3, 3,1, 4, ;16
6 Diedt and S Dis play the sum
Qrows at the falling Prop esthes+
exteeding or
sooce
probiem b End funchorn, not 0I i a binary seatch 4ree
A ete below fhis grouth.
The roct node is black
Simple C Code
) The chidren of red node are black
4 íncludc < stdioh>
No Toot to external node
poth nas 2 consceuhve Yed nsde
Unt5 2 Recutrence Reatorn express the same number d
Tionsfer mation int main(1 Telation is a way to it,,,8,,5.3,2. 4;16 S) AIl 4the root to external node poth confaun
number Time Co mgzity
A Fast Fourier Il Step2Input the ficst Ans+ A recurrence an aovihm in terms of it'% lack no de
int num 1 per Fovmance oF 8MMa 0ln)
NP Completeness rumber: ): Subect probiem solutior
Theory of P. NP ond print F( Enter the Furst an alorithm that ’ Insertion in Red - Black Tree
ond Randormized Algorifhim Scanf ("1 d', A num 1 reiation Jeptesent8 recursively ssNes olnlt nign node y It Siarts 0FF being Ted
@ Apro imatien This recur re nce fo halves,
.When we add a trew
Il Step3: Tnput the second nunber prublem intCombines the solutions Ao(nlgn)
diuidez the Step
then creote nesnode as root riode Loith Cobr Black
int num 2, number ): eoch half.
and
’ 14, 9, is, L IF tree ís ernpty nen
printe ( Enter he second \,7,9,3.2,4;i6 e wift color Red.
Scanf (td) hnum2);
in linear time
1t.8, le, 4, 3, 5, 3, 2, 1 16 a. IE tree is not empty then ínsert new nod
determine the overall neünoge (s Biack then eait.
It Step$: Add num1 and
num 2 relations heips 3. IF the parent of
Solving Sucn Exchatyc
new node is Red then chcck the
color oF
um 4+num 2: the algorithm 4 TE 4he parent 0F
int tum: time compiexity Of yelatior
L,8, 14, *, 3, 3, 5, 2, Ief16
sibling of new node
I Steps Display he Sum of vecurrence Aheapsige e A-heap-1 parent's
The aene ral form Black oY Dul then make
Sultable Yotatiort
Drinif ( Sum, Ldm', sum) TO) S. IF it's color is
T[n-1),-.
xeturn 0 TIn) E(n, T(n-t),
IF it's color is Red then Re (olor.

, 22)
Thrd pass (cortsider the fourth clement
Selection Sort repeafedly Master Theorem +
fhm that Cempare 22 ain (4. 15 and 12 "Sorting
Simple sor ting alor1 is 12 -Master Theorem is a tool that helps to
quickly assess and classiy
Seiectionn sort is a the un Soxied unsorted part wnich hen aith ar and men ce
largest) cienment from
-Second pass
clement in the 4 Suap 21 with (2, the time complexity Of certain type of recursive alqoriffm "Sorting i5 the process OF arranging a
ine Smoliest (er the clement
at the .Cind e minimum Aroy becames 2564 collection of
Seiecis su0Ps it with withoud solving them in desail item in a specific order
ottay and
part of the
unorted patt second element (25) analyze the
It TeFers to the arronging data in
beg1ning OF fhe Swap i2 wi th he Fourth pass consider s element 0) Master Theosem is a mnathemahcal formula used to some given sequencc
Such as increasing and
array becomes as 252264 ’Compare 11 with 64, a5, L2,11 time complexity OF recursive alqorithm decreasing order.
Alaorithm The an then (4 for exKample -
minimum ’ Suap Il with
i , hen wim LL, hes 1S, [5,2, 8, 123
clement as thc 22, (47 Specific formate
with the First
find the unsorled part[25,
tecurrence Relathon we want + soTt thiz tíst in
1 Start the atioy to Thurd Dass clement in te
The aray bece rmes
unsoried port of minimum T(n)- aT(%) +6(nklegkn) Astending order ,2,5.3, e7
Travecrse the "firnd tthe NOw, Array is rtw sorted
2 mininum elcmcnt
with he Firsi
clement of whicn 18 22 axl, b>|,k20 and pis a Yeal
number. Descendinq order Ce,1,5, 2,1]
mnimum ciement element (25)
the third
3. Swap with the
the unsorted part Soried and
unsorted Swap 22 mL22 25 16A 1 if a>tk then Tn) - Q(nlog,4) 1 Bubble sort
between the
becomes
The array
Q=4, be 2 k-|
boundary 2. if a: bk then Inse rtrion Sort
4. Move the (nly log Ptl n)
a) p>-1 then TUn)= G
ed Sorted a bk 3- Selection sor
part to the
riqht array is sort is now
the entire The arfay leqn) 4 Merqe sort

Repeat he
process unhil b) þ:-1 then T(n)* 6 (nltg oq 5. Quick sort
5
(hlog4)
. Example i] ) <- then T(n) 6- Heap sort
array'[64, 25, 12, 22, Radik sor+
Let's consider the 3. if a<bk then
3 Courting sort
- 6(nk log'n)
11. a) if p20 then T(n) Bucket Sort
part, which iA
.First pas5. the unsorted T(n) =(9 (n)
b) if þco then
O Shel Sort
minimum element in
. fnd the 22,L17
D Cycie Sbrt
[6+, L5, 1z, ett.
First element (64)
Swap il with the
beconmeu,25, 12, 22, 647
he array
 sere)
Shell Sort alaorithm(beneralizatien cf Tnserhen
Countins Sor1 Bosed on Inserhion
Sort
than 0djacent. "Hamiltornian cycle:
a part Ya ther
hr Sers'
hat
that are distant to identify a yce
Stept Sert Compare clements Internal .9+ Invclues Anding al pessibie path the Cycie
Rypntn Known as ap|
exacHy once and Conaplete
Size of unsoritd arroy
,
Al_urithm Spancing blw clement is we reach last UIsit Cach node
Seg
Nou, interval- hnlL reduced by 1
till
by returning to start nsde, using backtracking
pass, Grap i2
Stepl ’ Start In every
cement at interval() 1
Siep 3 Create sublists Sor pass ohen gap
i>
elemcnt in artay Methad 4
ferhnigue Step2 Set k largest volue in aray when Ne Ne 0F
Sort hese Subist using insertion sort Bormula
Floor NjL)
p Stepl’ Choose a vertex
Sfep4
|2 , Step3+ Create ne array Of Iength (KD, that atent
interval interval
Now, Exgmple Unsorted Array * Step24 Recursively uisit al connected neigh bours
Siess4
Stept4 Set (Count 0) For all incc indicies in nt) array part of patth
Sterl Rrgead te 3, on for interyal (ínterval|2), inds
Teppectively unhi he Steps Troverse array and ncrement respective count by Step Hami(tonian cycie Found, print HC
3, and
Stes 4 Rzeat Shep S,
Pass1
I in e - arry for eoch index value
N=9, last node= Start node
compietely sor ted 9F all hode are vísited and
ary i3
aepeitho in array
gap(Posst)=Fber () Step3
-flser(2) else
Erample 4 n5, Compictely travtis ed Step5
tep6 ’ Repeat untitl aay i backtrack and remove lost VErtex
Erem Patth and mat k

gap, 4 ct unuisited
Siept Create soried - oiray 0f lengin (aray) Siep
intevali E.ar Now, try other choices and Tep eat the
insert coch index value Step
Step8 Traverse ne-array and 3,4,5, 6, until HC Ís
found
>0,
in sorted -array unihl (ount
[s8,2r] Stepg 1 count= b
Cwomple A
[5,50]
[a,16] idex = ind ear1,
PassJ_
[5.15]
[1,30)
Stepls Print F(3oried orray'); Pass 1 9aP Fisar (347)
C,,e,75, 3s], Ca5,M52s, 35],
[o9,95] (8s, 36) (se, 15, 34, 1, (5] End
Sert
Stepl nAD EC BA
a.s,75, 84, 9), [s, ,), sr)
(34,54, is, 15, 6r ot

Q Binemial heap ’ Properties

4N-gue en problem
Binomial heap is a type of data structure Uhich keeps data Hesght of a binomial heap tree is always *
Ailgorithm inserhion and dechon in amprized ime
Sorted and alows Total node 2k
from leftmost Column Colection of bingmal tree For ( oto k,
SAe1 Stort
ploced Tefurn fec Stores data in sorted order 0t depth (, exact nodes are Ci L
Step TE n-Qucen
(= o, , 2,3
Write soluhisn, it Representah cn Bx if degree of root is k
Step (makng
eoch neat qucen
K4 h t B Finemial tree
Children are Br-, Bx- --B. [LtoR]
Columo disferent FeY
Step Try al Tous gnd gueen)
atacked by preuieus Examles
Sute (t ib not 1,2, 4,17, 1, I1,6, 8, 5
9 placing gucen leads a clash
Steps Step1
gueen Column
he preuious
Step6 Backtrack and change B, B, UB, Step2
8.degre Same) alid leti s union ch ET
2.
ste? c qe fo step

4-Qucens problem
for 2,+, 1, 33
State- Space Tree Stluhon
3,1,4, 23 Step3
Mimsy.S.

prablem
’ Solu han for A-Queen

"B4 UBu Step+

2
3

Ster L

Steps

sul^ 3, 6, 8, 1, 4,3, S,)

M.s
{2,5, 3,+10,4,)]
 Step 9 Step? Step6
Exle > Olep8 StepS e(R>P)
Ste4 S1ep fhm
Salesmanhave togiven 9t Step2 Start
segl Alqorn Rs,s,36,45,
[2s,34,,
22 returr Trave QuckSort
(Cost is a
matrig
Cost - sct alling Rapead We Lt
b End Repeat cise, ieft, 4,
he preblem gd, 59,
of ReapeatL,
Salesmar Swap Ra 1,er, 36,39,
3+11201t2el6/ stavdins Ciies tep Left unhi
of
Rigtit, 15,15, ,
usit
(L.R)
3ub Pa P te,
paint andfinding to Ps,2,
e
problem 8-arrayY LRj. 4r,
yery
custantes tD 36, 16,
stor 9EJ 94,31,
city Phvot,Kf
fest Sort subarag
(incoin) 8)
Cxactfy
onceandbelwcch pess the
be
roule Sub
boalat hem arra
pace
tree &or
ys
any

M8 Reduce
M4

TC= i6
c(l,4) =
c(2)a

3333,

CAP)
CsR)Ifalsc
L<)IFalpc
(L,FalSuapDs e

T-CC(+, 4
323) =7rt=l

Step 3reps Step Stes Step Stept

Exmple Ahorithm acohen if3
Cost "Master .Master
Dijkstra'
Amgreedys 4ime the
= updale Pick Assign SA D) a) b) ) Specific
formate ’ withud Thecrem
Master
Ese,
cost verhces
start if if p-1 pz- time
sum o
to he Theofemn
comgicaity of Thecrem
(test ihe verter(1)
distat bco p0 solving
step3 Complie
min 6(nltg.9)thT(en hen then a,T(n)-
(al min ce ten
sen if hen then xity
cdge)) dis e T(n) Tn)- is them is
(Cast anydistanfanre tan al b>l,k2o
Tn a
ce T(n) T(n) aT(%) o
cmcr 6 6 - algorithm
recursive tocd
at ver ver matthemahcal in of
(n(n'3 a(ntbs,9)
cages tex fty verfex (nm G(nK 6 ys 6(nElegn) + delal
certain that
a rem net g lg and helps
include lug'n)
let (m
ver oleady Iegn) n) pis fype
d)) fornmula to
to tx Vertes quickiy
b a
(0. inciuded real of
includeá (nv Qa4, 6
number used recursive
through e T(n) recurren
kelabsnce assess
b=
*T t
2
()tn analyzethe and
includtd K algoritfm
classify

tionPele > Stca Stept Stept

Step8 Step6 ampie. alqorithm
Warshall
5iepligorithm Floyd

Return D Cor Greate Set

no
(oeocD), in
D matrix of
vertices
of
nn,
n

Final
hap 0
fdistunce

nan

InserhonOperation
’0 -’"
thebyIhe a Fh Siructure A
Constant
hme trees
withOF A
Fibonaci
heap
minimum insertior,
nsert)Siorhng
A r min () Fibonacci fibonaci
ís tors
Reaphene
accessed
poinie key Onion,
hode hec heap heap
’insert 3 min Hin ( specific
in by is and is
MakefB( node)
[H] Fh a a a
pointer setdecrense data
here is properties,
the of structure
l8, min
39, node min-
LH] key
26,
contaning
35 to heapooperahons
allowing that
mint root
are
oF rdered maintains
eargthg)(No mark the a for
frec tre
in
nodkey-3 efficient
amoritizd 0
e con
poinfed collection
taining
 Rabin- korp method
min hea? e pro perhes
lns& The Rabn - karp alqcritm states ihat iF tuo
sting aas eunl their Knopsack problem ysin arcedy mefthod)
Gh 7 kMP olo
hash vales are abo eual Thes ao uses Freen
elementary rumber Set os item, each wit o weign and value, determine
the eretic ncticns Such a tthe cquiva len e of to number He no 0C each item
incude in a coliechon so that
node Algo For p
a hird.
ihe total weght is less than or e_ual SNen linit and
Algorithm total vãlue (s a) larqe as possible Step1 le
bi,s., AL
So, unsH Stepl * n= Aen [Tr] txample
tn en r] P ,21, 31, 3), 41,53,55, 653
-Marge( and ¬9 Step2 4 J i. 1, 21, 23, 33, 43.4s, ss3
n$, C 80 Step1 Cat
hf Hah (T(.-m)) Tmd g
Step3 for S-o to mn-m; Tiem
Deeting min em fn
iE (hf h)
print (valie mafcn ): itens lemainins Capac ty Prefit
print (" fund pattern with sEt
+ 21
Step3’ ma
Step& g9-1 68
else
prinr (" Spuny is'), 88-21= 67 +31 5tep4
Delete’ Minta) -3 Mnlu0 w paint he min vale in ngnt Count cEunt +1i P33
+43 KMP alao
StepSa +4-35 11
iE (5<n-m)
Stepl
n' =Hash r[srt srm]); 6
X53
Step 2
= 1356
Step3
irz s6

- Create a orray Items in knapsack

.Marge and 23 min
StepS

Example i0,16,5,4, 15, 13,25, (0,,9o A8T-Pngetie 3 Third pass Delehcn

Quick Sort
Ruct is duass bac k Compare 12 and , 300p hem [, 24,1, 25, (4J 19 25,53
Quick Sort is anottier
Suap em efFicicnt diuide and- corquer Sorting alqorithm.
2 Ng hue adjatent Red nade CompaYe A4 and l,
3 Ne-ef Biack liodes in cveryrath
I works by selecting apivot" element from the array and
are some
par titoning 4he other elements into two Sub- arroys according
lat paws whe ther they are less than or greater than the pivot.
Compare 12 and il, soap them , i2, 21, 25, c7 the sub-array are then Sorted recursively
Alqori thm ’
he aray () seY ted
1 Select Pivot:> Chonse a pivot element from the array
[,a, 24,25,s]
2 Partitíoning Rearrange the array Such that elements
less 4then the pivot are on the lelF, and
elements areater than the pivot are on the
right
3. Recursion Apply the quick Sort alqorithm recurSively to
4the sub- arrays Created by partitioninq.

"Example
3A|2|29|32s
Stepl+ Select pivot, ict say 24 (any elument)

Step2 Sub array

pivet
Element less hen (25| 243]32 9reater
Step eursienn
Recu

The array I Serted

 Q ¬ I5, S, 12, 16,19, 23, 5, 8 matching algonthm
Step Q:l|,T 31415326535652 93 , P- 26 Nalve string
Stepl " krush kal and Prisms Aleari thm n= len T]
Step h 311.M-9 Step
krushkal Prism's m lenfp]
S2 4t inc thiates t q hodelverty Step
91 iniHates aitn an edge
h 141-4|3 qraprh to n-m,
Steps Con be ugd on digo nnected graph Used only en co nnected For S-0
travel s hrouqh each
Step3
St only visit ene node once 91 );
mare han nt after shift
Worst Case fimne CompICuty
node
compleaity print("pattern ocurA
WerSt Case time
ht 151. |1=4) No vde Spuna (eunt 1 o(Ei0gE) o( Elogv)
S5 P= 1000|
Step (ound
2 Using Prism's Alge T 00lolo0olo
h551l 4 NO ) USins Krustkal Aqo
Cound 3^
h3218 O10l0 0olo
s nT, ,3,,3,1.9,2,S ’001o
Step S
abd hat Find mtin edge Vertxedse
i at
2
Valie hi fund aftr 6 sha Io0ol
totl spuriou) hit = 3
hn Sronibe trce
ooLlooolo
G J

Shafta2
vertt v
A ooLleee(
edca- lv-) 2.5

Red- Black Tree

M37 Sifta
Stept

(+)/
a(ter shitt
Pattem o curI

Q Moster theor m
Convey hull problem F the
i5 used to Cínd the
Comoie xity OF recursive alaorithms ’ Substitution method
points in n 9t
"Smallest Conver polygon that encloses a set of alaerithm is given as ! If n=1
b[w two poits
recurance relahion For thoat Tn) = add
plane, crsuring that any tinc segment LnTn-) iF n>l Based condition.
Lto R
in the set liu within or at the boundary of
Recurrence re lothon
the Convex polygoa here, a21,b>1, k20, and p (s
feal no
T(n)= *T(n-)-0
Eromple-Rubbet- band Conditions: Keg H3A H' )
put n: n- in eg" -0 Union
a>b
then T(n)- G(n'eg.)
.Ghrathom Scan alapritm So, T(n-) =(1-1) * T((n-)-)
if a=bk, then et n) T(n-): (n-1) 1 (n-2) -
Find paint . [bottom -1efirmost7 T() 6(nlogg,log
Stepl:
i) if p-l, then T(n-3) - in gr
S4ep2:
Mork al other pointa Pi P2 Pm
thenTnl (nies,, log(leg n)) put(n:n-1) T(n-2): (n-2) *
ockwis e u) if p -l, UBe Substituhon
according to min polar angle in
directienfrom 'P (F acbk, hen T(n) =n * (n-) * T(N-2) T(n-3) This i the final
JiF to pint are in Same angle
mark farthist pon 2
Pz.o, hen T(n) (ntlog'n) T(n) = n 4 (n-) *
(n-2) * Binomial heap.
i) iF cleminate Alter the deletion1
Top S] = o/MLL pco then Tin) (04)
Siep3:4 Geate siack, where
-Step 4 Push (); (n-1) 5tep3
(n-3) -- T(-(-1))
Example+
sIeCCuronce relation T()- T() +n n* (n-1) x(n-2) x
-Steps Pusn (?), (n-3) - - T()
’Using Master heorem n*n-)* (n-2) *
direction or naht
Check, whethcr next point is on left 342 *1
point. nx(n-1) ¥ (n-2) *
ditecthon From current
as4, h 2, K=2, p0
Tntermd order
n()*n-#)--n((lm(4)
.Step7 9
Psh (Peut)
PoP (Current Hem)
Step 8 nnn-n'
Pursn (Int)
Step & unhl To p(s) a Pmi
T(n)= 6(n tog, 1og*ln)
Step9: Repeat step 6 to : o(n",log'n)
=9(n"9 , logr1) o(nt logn)
Steple:4 Ruturn S
 Array o3o32 +52 S
fibonaci heap ’
Naxvalue ke 6
array CC) clemt vli A fi bonaci heap is a data structure that maintains 0 collectior1
oF trees wilt Specific properties, allowing For efficient
Insertior, union, and decrease key operations in amoritizd
Ceun taO
Constant ime
heap is a set of min- heap ordered tre.
" A fibonacci

O 2 Shueture,

9 LD

sted ag
trec conitaining
pointer min H] to root of a
Fh (H) (3 accessed by a
P a minimum key. (Min node)
node contaning the key3 poinfed
Ihe min heap- node in Eh (s the node.
18,39, 26, 35 are mark
Pa
by the G2 pointe min [H. here
min
(
P Operation’
P ’ Make fB’
P Stack 0 Inserhion ’

’insert 3 min()
slarting àr (No marziny)
l add (insert)

A Recurhlon tree
25
iterahon methocl. ao] 4C) a[2) a[3] ia[4]
sepresentation of an
" 9+ píctorial
epancud 5tep 2
9t i6 a Cat level no dU) a
tree
HUu, each nodes represents the cost oF a single sub- problcm Swap/o )Swap
for divide and Conguer algoriths.
Mostly useful
analyze compiexity of an alqori thms
Helps to Remove element
1525
T(n) = aT() t o(n) a] 40) 42] 43 a4)
Gh hyet
Step3
Swap Swap

Remove elument
n=1
Cosil level
Total cost = No-of levels x a) 40) a2] 4(:) 4[4]
= logn X Cn
Complcaity
|Tn) = nlogr Ms- Time Step4
Swap Rumove

e T(n) T(2)+ T(4) +T() +o(o) elumunt

\a0] al) a(3) a[4]

2X4
Steps
X

Total cosi = Cntntn)'nt- Is25Sorted heap

uytoi temm SortedAray =
Proper heap Min heaf ht

Cn
 DOST
CSE WALE