algoritm

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...

This file contains 5 pages in DOCX format (678.5 KB). To download "algoritm", click the Telegram button on the left.