Zbekiston respublikasi axborot texnologiyalarini rivojlantirish vazirlligi muhammad al-xorazmiy nomidagi toshkent axborot texnologiyalari universiteti

O’ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARINI RIVOJLANTIRISH VAZIRLLIGI
MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

Ma‘lumotlar tuzilmasi va algoritmlar FANIDAN

3-AMALIY TOPSHIRIQ


MAVZU: MAVZU:STACK,QUEUE,DEQUEUE(STEK,NAVBAT,DEK)

Bajardi: ALMAMATOV JAVLONBEK(SWD008-1)
TOSHKENT 2023



4-topshiriq
N ta elementdan tashkil topgan navbat berilgan.navbatning eng kichik elementini toping va bu elelementni 0 bilan almashtiring.

Dastur kodi
#include
#include
#include
using namespace std;

int findMinimumElement(queue& q) {
int minimum = q.front();
while (!q.empty()) {
int current = q.front();
if (current < minimum) {
minimum = current;
}
q.pop();
}
return minimum;
}

void replaceWithZero(queue& q, int target) {
deque temp;
while (!q.empty()) {
int current = q.front();
q.pop();
if (current == target) {
temp.push_back(0);
} else {
temp.push_back(current);
}
}
for (int i = 0; i < temp.size(); i++) {
q.push(temp[i]);
}
}

int main() {
queue myQueue;

// Navbatning elementlarini kiriting
int n;
cout << "Navbatning elementlarini kiriting: ";
cin >> n;

for (int i = 0; i < n; i++) {
int element;
cout << "Elementni kiriting: ";
cin >> element;
myQueue.push(element);
}

int minimumElement = findMinimumElement(myQueue);
replaceWithZero(myQueue, minimumElement);

cout << "Eng kichik element: " << minimumElement << endl;
cout << "Elementlar 0 bilan almashtirildi." << endl;

// Yangi navbatni chiqarish
cout << "Yangi navbat: ";
while (!myQueue.empty()) {
cout << myQueue.front() << " ";
myQueue.pop();
}
cout << endl;

return 0;
}

Dastur natijasi: