0% found this document useful (0 votes)
5 views8 pages

Matrix Operations and Algorithms Guide

The document discusses various algorithms and data structures, including linear arrays, matrix operations, and sorting techniques. It covers time complexities for different operations and provides examples of searching methods such as linear and binary search. Additionally, it outlines the process of inserting and deleting elements in data structures and the implications of these operations on performance.

Uploaded by

Dz sasank
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views8 pages

Matrix Operations and Algorithms Guide

The document discusses various algorithms and data structures, including linear arrays, matrix operations, and sorting techniques. It covers time complexities for different operations and provides examples of searching methods such as linear and binary search. Additionally, it outlines the process of inserting and deleting elements in data structures and the implications of these operations on performance.

Uploaded by

Dz sasank
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Assi7amet

3-0 an A 2.9,-4
BA 2 , W 4 0 , A ( 5 , -19)
+
Hultimeiónal Aay
Aro ayohas n su caiptHhenit
An-imensina
asn-Di
AMJ[t Ilt.m3J..J .. [1m1

Thanoman Ke,K2,K34
Ro
1,t an vey H
has Coues Obound and d d th
eah aubsCTipt calulaed

(Thu elladive inder) Ei


aukacipt Ki
qiven Ei = Ki- LB
for
alulae a
.Kn] caleul,led as
Thu addus o) ACKr,k2.
twGL+E,)La +6, )LyEn-yati
0c (ALKI Ka- Kn]) b

Agkcakon
an uad store ist val.,

Ariay ans wed to puorm matix opunadion


ans wnd to implerent
Linean Stah, binay
sMonding orithm
Sea.

spona imnatrix.
Openation on Linean Aryay
we iun the lemnt, )
pint or count ayhieue
Casb

frauting
Lo 2,3 Y4 8
Algorithen
"r

Shop
Time' onongbaty
int t tiae an
#inlude<sttioh
#inelu<ianio h
void mainl)
int K,LACS110,20,312,13)5f, K=0;
whil (Ks4)

KeK+;

2) Tnalior
Tinatioditelers t openatio adding
lninólindin
th
OLrt an elent ot at
at en

3 4 5

1 2 34 5 G 7
inot
2 3 45
inaent 257

3 4 S 1
| 2
ocalim

234 5(
loc =3 item ||

Alypriaro 1 2 3 4 S5
Lnt
(LA.N.K, tem)piton (ot given loalion)
s T=N
whie T>K LA o2o
3 sy
2 Rup est step LA[T]
3 sit LA CJH
LA LRI
i6 26
7: Ex t

Time 0(n) 13 4 5 (.

otend
campleaity oli)

Tme congleriy 0ln)


elatin
removing an eumet
vay mua
d i n g Inin wih nert elnt
Thoe
) an
dte an enent at end ol
(9) A t an l t a
(best c a )
Binningln u) End
302 25 90
delale 30 2 |3-|28- 25|90|35
3 4
23 25 1a0
Tme Comp lexity ()
2al125lA0 135
2 3 5 at qien ocaion
|3028 25 |40|357
23 4 5
reioa35 2

KeB,tem=25
1 2

as2sho 35n-l=4 328 40|351


2

Tmytoimpliti-Oln) [3o)22|9D| 357 i

3022 1{0 351


Algorithm
Set ite
Time

Sot N-N
ext
(lo

peixolqrna
to the opuahon o
nsortn
lemht on ovay in incia) ing .orden

Sorling ordn ! - 5 o2° (23


AA(3 A2J<A[3] <AL abiant elannh
Cubble s ort yRipudeay cony
Assu AC3,A[23,AC31, AL4] AC
Passi compouA] $A[2] 3anoan in or den ALJ<A[2]
AC3]<AC4].
A[n-1J# A[a]: A [a-]<Aln]
Pass 2 A[]<A2]
* , ALn-2] <An=11
2a13|25 |6
Pass1ial2o|13 25]6 Pas3
n-1
13l15|14|20
1a1320|15 1257 as
Pass 2 n-4 U315 192025
n-2 -(sl1s|1 825
elmt =5 n
Pa =n -] =4
n (n)
Tne Complxcty '- 06 2
Aorithnn Buboe (AATA, N)
e t sttp 2 s3 or K=I to N
2° Kg,PTR
Repeat whle PrA s N-K pinden vaual
3.
i) oATA [PTRI DATACPTR+17
Intersanged oATAter R] 3DATA [erA+1]
rosihen)
set PTR °prRtI
Szanding:
94 is the poceas o Jind anaunt
clen in ist

is'loùn d tnuide tha list thon


S the cloment suastu)ohnwise
|ailwe.
Suuh item'4.
un- suiui
Searh ter 5
t is a un-sies
n

2)
inn Sanh
Binay Saah
(uyinuy iianh )

Saanhin [Link] his mhod


S h in the ist
This hing mehad is aplid on sotd tt.
Algori thy
[5]0,20,30, 40,50pigl
st a.
input searhing tem
9 <5
Rep eat step awhi
tminthen ol
09) a li]iem found locaion ji exib.
frint
Lomglain-on)

(9 Ert
Seah
Auway sored isk
-’3t is he di vide and
tenige the da ta in
+In which w h e to annang
fariula lormatbelore
lormat beTo saarsig op enatn.
A\e thhat w 0,ment an

autay compen ith torget mnt


edemun
+9) Aut the tagt
dmsnt. hk the tuyet munt is qrate
demnt
midd, lemunt.
han or luw than
midde
xeater than tiht side elmnt.
nt thenuwise uat stle o midd
Algorithm
Os as]lo,20, 30,40,50 2

3) sot
itm 2

Ripeat Owhle l <vg


Sut mid- lrtuB/2
) almid] - iten hun
3 a[mid l< itm then os amplority: o(ay
v mid-]
then vind iten ond
tint itm not ound.
Asslyanant
betun ini souh and

You might also like