algoritm

DOCX 5 sahifa 678,5 KB Bepul yuklash

5 sahifa

FaylHub.uz

Telegram orqali yuklab olish

Hajm 678,5 KB

Fayl turi DOCX

Sahifalar 5

Yangilangan Dek 2025

Sahifa ko'rinishi (5 sahifa)

Pastga aylantiring 👇

1 / 5

$o’zbekiston respublikasi raqamli texnologiyalar vazirligi muhammad al-xorazmiy nomidagi toshkent axborot texnologiyalar universiteti ma’lumotlar tuzilmasi va algoritmlar fanidan 3-amaliy topshiriq toshkent – 2024 18-variant #include using namespace std; void swapfmlx(int arr[], int n, int index, int minindex, int maxindex, bool firstminfound, bool lastmaxfound) { if (index >= n) { if (firstminfound && lastmaxfound) { // birinchi minimum va oxirgi maksimumni almashtirish swap(arr[minindex], arr[maxindex]); } return; } // birinchi minimumni topish if (!firstminfound && arr[index] = arr[maxindex]) { maxindex = index; lastmaxfound = true; } // rekursiv chaqiruv swapfmlx(arr, n, index + 1, minindex, maxindex, firstminfound, lastmaxfound); } int main() { int n; cout > n; if (n > arr[i]; } int minindex = 0, maxindex = 0; swapfmlx(arr, n, 0, minindex, maxindex, false, false); cout << "massivni almashtirilgan ko'rinishi: \n"; for (int i = 0; i < n; ++i) { cout << arr[i] << " "; } cout << endl; return …$

2 / 5

3 / 5

4 / 5

5 / 5

Ko'proq o'qimoqchimisiz?

Barcha 5 sahifani Telegram orqali bepul yuklab oling.

To'liq faylni yuklab olish

"algoritm" haqida

o’zbekiston respublikasi raqamli texnologiyalar vazirligi muhammad al-xorazmiy nomidagi toshkent axborot texnologiyalar universiteti ma’lumotlar tuzilmasi va algoritmlar fanidan 3-amaliy topshiriq toshkent – 2024 18-variant #include using namespace std; void swapfmlx(int arr[], int n, int index, int minindex, int maxindex, bool firstminfound, bool lastmaxfound) { if (index >= n) { if (firstminfound && lastmaxfound) { // birinchi minimum va oxirgi maksimumni almashtirish swap(arr[minindex], arr[maxindex]); } return; } // birinchi minimumni topish if (!firstminfound && arr[index] = arr[maxindex]) { maxindex = index; lastmaxfound = true; } // rekursiv chaqiruv swapfmlx(arr, n, index + 1, minindex, maxindex, firstminfound, lastmaxfound); } int main() { int n; cout > n; if (n > arr[i]; } int mi...

Bu fayl DOCX formatida 5 sahifadan iborat (678,5 KB). "algoritm"ni yuklab olish uchun chap tomondagi Telegram tugmasini bosing.

Teglar: algoritm DOCX 5 sahifa Bepul yuklash Telegram