Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiyalari universitetining dasturiy injiniring fakulteti 316-21 guruhi 2-bosqich talabasi Rahmonov Akbarshohning Malumotlar tuzilmasidan fanidan bajargan ishi

Muhammad al-Xorazmiy nomidagi Toshkent axborot texnologiyalari universitetining dasturiy injiniring fakulteti 316-21 guruhi 2-bosqich talabasi Rahmonov Akbarshohning Malumotlar tuzilmasidan fanidan bajargan
ISHI.

O’qituvchi : G’iyosov Ulug’bek

Toshkent – 2022
17/Find the smallest element of the stack and then replace that element with 0.

#include
using namespace std;
void ReplaceElements(int arr[], int n)
{
int min_ele = arr[0];
arr[0] = -1;
for (int i = 1; i < n; ++i) {
if (min_ele < arr[i])
arr[i] = min_ele;

else if (min_ele >= arr[i]) {
int temp = arr[i];
arr[i] = min_ele;
min_ele = temp;
}
}
}
int main()
{
int arr[] = { 4, 5, 2, 1, 7, 6 };
int n = sizeof(arr) / sizeof(arr[0]);
ReplaceElements(arr, n);
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";
return 0;
}