count() – konteynerdagi berilgan sohada shartni qanoatlantiruvchi
nechta element borligini aniqlash algoritmi (-listing)
#include
#include
#include
#include
using namespace std;
int main()
{
int arr[] = {33,22,33,44,33,55,66,77};
int n=count(arr,arr+8,33);
array arr1{33,22,33,44,33,55,66,77};
cout<int n1=count(arr1.begin(),arr1.end(),33);
cout<vector A{1,2,3,4,5,6,7,8,1,1,4,4,4};
n1 = count(A.begin(), A.end(), 1);
cout<<"Umumiy soni: "<}
search() - ba'zi algoritmlar bir vaqtning o'zida ikkita konteynerda
ishlaydi. Misol uchun, find() algoritmi belgilangan qiymatni bitta
konteynerda qidirsa, search() algoritmi boshqa konteynerdagi bitta
konteyner tomonidan belgilangan qiymatlarning butun ketma-ketligini
qidiradi (-listing).
#include
#include
#include
using namespace std;
int main()
{
int A[] = { 11, 44, 33, 11, 22, 33, 11, 22, 44 };
int B[] = { 11, 22, 33 };
int* ptr;
ptr = search(A, A + 9, B, B + 3);
if(ptr == A + 9)
cout << "Moslik mavjud emas\n";
else
cout << "Moslik bor. Indeks: " << (ptr - A) << endl;
return 0;
}
Vektorlarda qo’llanilishi keltirilgan misol (-listing)
#include
#include
#include
using namespace std;
int main()
{
vector A{1,2,3,4,5,6,7,8,9,10};
vector B{4,5,6};
vector ::iterator b;
b=search(A.begin(),A.end(),B.begin(),B.end());
if(b == A.end())
cout << "Moslik mavjud emas\n";
else
cout << "Moslik bor. Indeks: " << b-A.begin() << endl;
return 0;
}
Do'stlaringiz bilan baham: |