Amaliyoty ishi-n 3 mavzu: stack,queue,dequeue(stek,navbat,dek) Bajardi : Jamolov Bexruz 7-Variant

AMALIYOTY ISHI-N 3
MAVZU: STACK,QUEUE,DEQUEUE(STEK,NAVBAT,DEK)

Bajardi : Jamolov Bexruz

7-Variant
N ta elementdan tashkil topgan navbat berilgan.navbatning eng katta elementini o’chiring.

#include

int main() {
using namespace std;
// Foydalanuvchidan massiv uzunligini olish
int n;
cout << "Massiv uzunligini kiriting: ";
cin >> n;
// Massivni tuzamiz
if (n > 0) {
int arr[n];
// Foydalanuvchidan massiv elementlarini olish
cout << "Massiv elementlarini kiriting:\n";
for (int i = 0; i < n; ++i) {
cout << "Element " << i + 1 << ": ";
cin >> arr[i];
}
// Eng katta elementni topamiz
int eng_katta = arr[0];
int eng_katta_indeks = 0;

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

if (arr[i] > eng_katta) {
eng_katta = arr[i];
eng_katta_indeks = i;
}
}
// Eng katta elementni o'chiramiz
for (int i = eng_katta_indeks; i < n - 1; ++i) {
arr[i] = arr[i + 1];
}
n--; // Massiv uzunligini kamaytiramiz
cout << "Eng katta element o'chirildi.\n";
// Yangi massivni chiqaramiz
cout << "Yangi massiv: ";
for (int i = 0; i < n; ++i) {
cout << arr[i] << " ";
}
cout << endl;
} else {
cout << "Noto'g'ri massiv uzunligi.\n";
}
return 0;
}


Natija