Jadval funksiyani Fure qatoriga yoyish. Fure koeffitsientlarini hisoblash. Qator hadlari sonini tanlash Ishdan maqsad

TOPSHIRIQLAR
9. n ta 2 xonali son kiritilsin. Keyin 1 ta 3 xonali son kiritlganda shu kiritilgan songa yaqin sonni toping.
intmain()
{
queue gquiz;
gquiz.push(10);
gquiz.push(20);
gquiz.push(30);
cout << "The queue gquiz is : ";
showq(gquiz);
cout << "\ngquiz.size() : "<< gquiz.size();
cout << "\ngquiz.front() : "<< gquiz.front();
cout << "\ngquiz.back() : "<< gquiz.back();
cout << "\ngquiz.pop() : ";
gquiz.pop();
showq(gquiz);
// We can also use front and back as
// iterators to traverse through the queue
count<<"Using iterators : ";
for(autoi = gquiz.front(); i != gquiz.back(); i++)
{
count<< i <<" ";
}
return0;
}



Xulosa:
Misol uchun metrik bo'shliqda n nuqtalari berilgan, ular orasidagi eng kichik masofa bo'lgan bir necha nuqtani topish masalasini ko’rib chiqaylik. Evklid tekisligidagi eng yaqin nuqtalarning vazifasi geometrik algoritmlarning hisoblash murakkabligidan muntazam ravishda o'rganilishi kerak bo'lgan birinchi geometrik vazifalardan biri.