Guruh Abdurashidov Bexruz

O
‘zbekiston Respublikasi Raqamli texnologiyalari vazirligi

Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiyalari universiteti


Algoritmlarni loyihalash fanidan amaliy ish

Bajardi316_21 guruh
Abdurashidov Bexruz
Tekshirdi: Ravshanov Anvar
Toshkent-2023

1-Amaliy ishi
Mavzu: Massiv elementlarini tartiblashtirish. Matrisa maksimal, minimal elementini aniqlash algoritmi. Matrisalarni ko’paytirish dasturi. Amallar tartibini baholash.

Bajarilish tartibi:

2. Kod Java scriptda da yozildi:
let nums = [3, 5, 7, 9]; // massivni e'lon qilamiz
let firstEven = null; // birinchi juft sonni ajratish uchun o'zgaruvchi
for (let i = 0; i < nums.length; i++) {
if (nums[i] % 2 == 0) { // agar son juft bo'lsa
firstEven = nums[i]; // birinchi juft sonni ajratamiz va tsikldan chiqamiz
break;
}
}

if (firstEven == null) { // agar juft sonlar topilmagan bo'lsa

console.log("Massivda juft sonlar yo'q");
} else {
for (let i = 0; i < nums.length; i++) {
if (nums[i] % 2 == 0) { // agar son juft bo'lsa
nums[i] *= firstEven; // sonni birinchi juft sonning qiymatiga ko'paytiramiz
}
}
console.log(nums); // [3, 5, 7, 9]
}


Blocksxemasi:

+-------------------------+

| nums = [3, 5, 7, 9] |
| firstEven = null |
| i = 0 |
+-------------------------+
|
| nums[i] % 2 != 0
v
+-------------------------+
| "Massivda juft sonlar yo'q"|
+-------------------------+

+----+ nums[i] % 2 == 0 +-------------------------+

| i++|-------------------------------> firstEven = nums[i] |
+----+ | break |
+-------------------------+
|
v
+-------------------------+
| i = 0 |
+-------------------------+
|
+---------------------+ | nums[i] % 2 == 0
| nums[i] *= firstEven|<---+
+---------------------+
|
v
+---------+
| i++ |
+---------+
|
v
+------------------+
| i < nums.length? |
+------------------+
|
v
+-------+
| End |
+-------+