Algoritm kutubxonasi va ularni konteyner sinflari bilan ishlatish usullari
 { cout << n << " "; });
cout << endl;
// count
int count1 = count(vec.begin(), vec.end(), 5);
cout << "5 soni: " << count1 << endl;
// find
auto it = find(vec.begin(), vec.end(), 8);
if (it != vec.end()) {
cout << "Topildi: " << *it << endl;
} else {
cout << "Topilmadi!" << endl;
}
// all_of
if (all_of(vec.begin(), vec.end(), [](int i) { return i % 2 == 0; })) {
cout << "Juft sonlar" << endl;
} else {
cout << "Toq sonlar" << endl;
}
// any_of
if (any_of(vec.begin(), vec.end(), [](int i) { return i % 2 == 0; })) {
cout << "Juft son qaytarildi" << endl;
} else {](https://docx.uz/documents/f4ced713-c9b2-48d0-aaeb-0b967730ac56/page_4.png?v=1)
 { return i < 0; })) {
cout << "Musbat son" << endl;
} else {
cout << "Manfiy son" << endl;
}
return 0;
}
2. Konteynerlarni o’zgartira oladigan algoritmlar :
Ushbu algoritmlar konteynerdagi elementlarni o'zgartiradi yoki
o'zgartirilgan elementlar bilan yangi konteyner ishlab chiqaradi.
Misollar: copy, transform, replace, remove, fill, generate, unique va
hokazo.
#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>
#include <cstdlib> // srand, rand
#include <ctime> // time](https://docx.uz/documents/f4ced713-c9b2-48d0-aaeb-0b967730ac56/page_5.png?v=1)
 { return n * n; });
cout << "Transformed list: ";
for (const auto& element : transformed_lst) {
cout << element << " ";
}
cout << endl;
// replace
replace(lst.begin(), lst.end(), 5, 50);
cout << " 5 ni 50 ga almashtirgandan keyin ro yxat qiling: ";ʻ](https://docx.uz/documents/f4ced713-c9b2-48d0-aaeb-0b967730ac56/page_6.png?v=1)
![for (const auto& element : lst) {
cout << element << " ";
}
cout << endl;
// remove
lst.remove(3);
cout << " 3 element o’chirildi: ";
for (const auto& element : lst) {
cout << element << " ";
}
cout << endl;
// fill
fill(lst.begin(), lst.end(), 0);
cout << " Ro'yxat 0 bilan to'ldirilgandan keyin: ";
for (const auto& element : lst) {
cout << element << " ";
}
cout << endl;
// generate
srand(time(0));
generate(lst.begin(), lst.end(), []() { return rand() % 100; });
cout << " Tasodifiy sonlarni yaratgandan so'ng ro'yxat: ";
for (const auto& element : lst) {
cout << element << " ";](https://docx.uz/documents/f4ced713-c9b2-48d0-aaeb-0b967730ac56/page_7.png?v=1)
![return 0;
}
4. Raqamli algoritmlar :
Ushbu algoritmlar raqamli operatsiyalar uchun ishlatiladi.
Misollar: accumulate,0 inner_product, iota, min_element, max_elementva
boshqalar.
#include <iostream>
#include <queue>
#include <vector>
#include <numeric> // accumulate
#include <algorithm> // min_element, max_element
using namespace std;
int main() {
queue<int> q;
// Elementlarni qo'shish
for (int i = 1; i <= 10; ++i) {
q.push(i);
}
// Barcha elementlarni qatordan vector ga nusxa olish
vector<int> vec(q.size());
for (size_t i = 0; i < vec.size(); ++i) {
vec[i] = q.front();
q.pop();](https://docx.uz/documents/f4ced713-c9b2-48d0-aaeb-0b967730ac56/page_11.png?v=1)
Algoritm kutubxonasi va ularni konteyner sinflari bilan ishlatish usullari