IF (B > C) THEN
Write —Biggest number is”, B
ELSE
Write —Biggest number is”, C
End
END.
ALGORITM: Uchburchakni yuzini topish.
Uchburchakni uchta tomoni berilgan A, B, C. Biz ushbu uchburchakni yuzini topishimiz kerak. S - perimetr.
INPUT A, B, C
IF (((A+B) >C) AND ((B+C) >A) AND ((C+A) > B)) THEN
Begin
S <- (A + B + C)/2
Area <- VS x (S - A) x (S - B) x (S - C)
Write —Area of triangle is”, Area, —sq. units”
End
ELSE
Write —Triangle is not possible”
END.
ALGORITM: Kvadrat tenglamani ildizini aniqlash.
Kvadrat tenglamani ildizini aniqlash (Ax2 + Bx + C = 0)
INPUT A, B, C
IF A = 0 THEN
Begin
IF B = 0 THEN
Begin
Write —Equation is degenerate” goto step 5
End
ELSE
Begin
Write —Linear equation has single root”
xl = -C/B
Write —Root =”, xl
goto step 5
End
End
D = B x B - 4.0 x A x C
IF D > 0 THEN
Begin
Write —Real and distinct roots” xl = (-B + VD) / (2.0 X A)
x2 = (-B - VD ) / (2.0 x A)
Write —First root =”, xl Write —Second root =”, x2
End
ELSE
Begin
IF (D = 0) THEN
Begin
Write —Real and equal roots” xl = -B / (2.0 x A) x2 = xl
Write —First root =”, xl Write —Second root =”, x2
End
ELSE
Begin
Write —Imaginary roots” xl = -B / (2.0 x A) x2 = xl
yl = V-I) / (2.0 x A) y2 = -yl
Write —First root”
Write —Real part”, xl, —Img. part”, yl Write —Second root ”
Write —Real part”, x2, —Img. part”, y2
End
End
END.
11.3. Algoritm: massiv elementlarini yig'ndisini aniqlash.
20 elementni yig'indisini topish kerak. NUM sonlar joyi aniqlanadi.
SUM yig'indisi saqlanadi.
SUM <- 0
NUM <
Repeat for COUNT = 1, 2, , 20
Begin
SUM <- SUM + NUM
NUM <- NUM + 4
End
Write —Sum of 20 terms is”, SUM
End.
ALGORITM: N son yig'indisini aniqlash.
Berilgan N son. Biz bu sonlarni yig' indisini aniqlashimiz kerak.
NUM nomerni saqlash uchun vaqtincha belgilagan o'zgaruvchi. COUNT sonlar yig'indisini anglatadi. Sikl boshqaruvchisi sifatida hisob o'zgaruvchisi ishlatiladi.
Read N
SUM <- 0
Repeat for COUNT = 1, 2, , N
Begin
Read NUM
SUM <- SUM + NUM
End
Write —Sum of inputted numbers is ”, SUM
End
ALGORITM: Ikkita massivini birlashtirish.
M va N o'lchamlarga ega tegishli ravishda ikkita A va V massivlari berilgan. S massivi M + N o'lchamlarga ega A va V massivlarini birlashtirish bo'yicha algoritmini tuzing.
I massiv indeksi. A massivi birinchi va V ikkinchi bo'ladi deb hisoblaymiz.
S massivi M + N o'lchamlarga ega A va V massivlarini birlashtirish bo'yicha algoritmini tuzing.
I massiv indeksi. A massivi birinchi va V ikkinchi bo'ladi deb hisoblaymiz.
Repeat for I = 1, 2, , M
cm <- Afii
Repeat for I = 1, 2, N
CfM+Il<- BUI
1. END.
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 indeksi50.
LARGEST <- Aril
Repeatfor I = 2, 3, ,N
Begin
IF (Aril > LARGEST) THEN
LARGEST <- A[I1
End
Write —Largestnumberis ”, LARGEST
END.
Do'stlaringiz bilan baham: |