cm+i\<-
b u i
1. END.
11.4. ALGORITM: Massiv elementlar ichidan eng kattasini
topish algoritmi.
N elementdan tashkil topgan A massivi berilgan.
Ushbu
algoritm massiv elementlari ichidan eng kattasini topish uchun
xizmat qiladi. I massiv indeksi41.
1. LARGEST <- Aril
2. Repeatforl =
2,
3,, N
Begin
IF
(Aril >
LARGEST) THEN LARGEST
<-
Л|
1
1
End
3. Write “Largestnumberis ”,
LARGEST
4. END.
ALGORITM: Massiv elementlarini yig‘indisi va o‘rta
arifmetikasini hisoblash.
Berilgan N elementdan tashkil topgan massiv Л. Ushbu
algoritm massiv elementlarini yig‘indisi va o ‘rla arifmetikasini
hisoblash uchun xizmat qiladi. I massiv indeksi.
1. SUM<- 0
2. Repeatforl = 1,
2,,
N
SUM <- SUM +
Aril
3. AVG <- SUM/N
4. Write SUM, AVG
5. END.
11.5. ALGORITM: Chiziqli yoki ketma-ket tashkil etilgan
qidiruv.
Berilgan N elementdan tashkil topgan massiv A. Ushbu
algoritm massiv DATA elementini qidirish uchun xizmat qiladi. I
massiv indeksi.
I < - 1
1. While (I
41 J.B.Dixsit. “Fundamentals o f computer programming and IT” 2011. 155 p.
2.
II- (Aril = DATA) THEN
Ucgin
Write “Successful search”
Write DATA, “found at position”, I goto step 5
End
ELSE
Begin
I < - 1 + 1
End
3. Write “Unsuccessfulsearch”
4. END.
ALGORITM: lkkilik qidiruv.
Berilgan N elementdan
tashkil topgan massiv A, elementlari
o‘sish tartibida tartiblangan. Ushbu algoritm
massiv elementlarini
ichidan eng katta, eng kichkina va o‘rta
qiymatini berilgan
intervalda izlash uchun xizmat qiladi. I massiv indeksi.
LOW <- 1 HIGH <- N
1. While (LOW < HIGH) DO upto step 4
2. MID <- Integral part o f ((LOW+ HIGH)/2)
3. IF (DATA = AfMID 1)THEN
Begin
Write “Successfulsearch”
Write DATA, “found at position”, MID goto step 6
End
ELSE
Begin
IF (DATA > AfMIDl) THEN LOW <- MID + 1
ELSE
HIGH <- MID - 1
End
4. Write “Unsuccessfulsearch”
5. END.
280
