Laboratorya ishi

Muhammad al-Xorazmiy Nomidagi Toshkent Axborot Texnologiyalari Universiteti

Ma'lumotlar tuzilmasi fanidan

LABORATORYA ISHI

Bajardi: Abduvoris Abdujabborov

Guruh:001

Laboratorya ishi

Ketma-ket qidiruv usulidan foydalanib, ro‘yhat eng kichik elementini toping.

#include

#include

#include

#include

Using namespace std;

Int main() {

Srand(time(0));

Int s;

Cout << «Navbatda nechta element bo`lishini hohlaysiz: «;

Cin >> s;

Queue q;

For(int i = 0; i < s; i++) {

q.push(rand()% 100);

}

Cout << «Navbat elementlari: «;

Int min_value = INT_MAX;

Size_t size = q.size();

While (size-- > 0) {

Int x = q.front();

Cout << x << « «;

q.pop();

q.push(x);

if (x < min_value)

min_value = x;

}

Cout << «\nNavbatning eng kichik elementi: « << min_value;

}