Va kommunikatsiyalarini rivojlantirish vazirligi muhammad al-xorazmiy nomidagi toshkent axborot texnalogiyalari universiteti

O’ZBEKISTON RESPUBLIKASI AXBOROT TEXNALOGIYALARI

VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI

TOSHKENT AXBOROT TEXNALOGIYALARI UNIVERSITETI

Ma’lumotlar tuzilmasi va algoritmlar fani bo’yicha

Laboratoriya ishi

Mavzu: N TA ELEMETNDAN TASHKIL TOPGAN MASSIV(N –NATURAL SON)
Bajardi: 214-19 guruh talabasi

Temurbek Ro’ziyev

Tekshirdi: Sanjar Mo’minov

17-variant

17. Berilgan sonlar ketma-ketligidagi har bir elementni o‘zi, o‘zidan oldingi va o‘zidan keyingi element bilan yig‘indisiga almashtiring.

// C++ program to update every array element with

// sum of previous and next numbers in array

#include

using namespace std;

void ReplaceElements(int arr[], int n)

{

// Nothing to do when array size is 1

if (n <= 1)

return;

// store current value of arr[0] and update it

int prev = arr[0];

arr[0] = arr[0] + arr[1];

// Update rest of the array elements

for (int i = 1; i < n - 1; i++) {

// Store current value of next iteration

int curr = arr[i];

// Update current value using previews value

arr[i] += prev + arr[i + 1];

// Update previous value

prev = curr;

}

// Update last array element separately

arr[n - 1] = prev + arr[n - 1];

}

// Driver program

int main()

{

int arr[] = { 2, 3, 4, 5, 6, 7, 8, 9, 10 };

int n = sizeof(arr) / sizeof(arr[0]);

ReplaceElements(arr, n);

// Print the modified array

for (int i = 0; i < n; i++)

cout << arr[i] << " ";

return 0;

}

Natija: