Ketma-ket qidiruv algoritmi

Ishni bajarishga oid namuna

Talabalar Ma’lumotlaridan – FIO va adresdan iborat jadval berilgan. Binar qidiruvdan foydalanib TTJ da yashaydigan talabalar ro’yhatini hosil qiling

#include

using namespace std;

int main(){

int n;

cout<<"n=";

cin>>n;

struct Guruh{

string fio,adres;

}

talaba[n];

for(int i=0;i

cout<

cin>>talaba[i].fio;

cout<<"adres=";

cin>>talaba[i].adres;}

//jadval binar qidiruv olib boriladigan maydoni bo‘yicha tartiblangan

//bo‘lishi kerak

for(int i=0;i

if(talaba[i].adres>talaba[j].adres){

Guruh h=talaba[i];

talaba[i]=talaba[j];

talaba[j]=h;

}

for(int i=0;i

cout<

cout<

int low = 0,hi = n-1,search=-1,q=0; string key="TTJ";

while(low<=hi){

int mid = (low + hi) / 2; q++;

if (key == talaba[mid].adres){ search = mid;

break;}

if (key < talaba[mid].adres) hi = mid - 1;

else low = mid + 1;}

if(search!=-1)

cout<<"qidirilayotgan el "<

else {cout<

return EXIT_SUCCESS;}

while(talaba[search-1].adres==key) search--; while(talaba[search].adres==key) {

cout<

search++; } system("pause");

}

10. Boshiga qo‘yish usulidan foydalanib ro‘yxatda 11 ga butun bo‘linuvchi eng katta sonni toping (agar bunday sonlar ko‘p bo‘lsa, u holda ularning eng kattasini toping; agar bunday son mavjud bo‘lmasa – shunga mos ma’lumot chiqaring).

#include

using namespace std;

int main(){

int n;

cout << "Nechta: "; cin >> n;

int a[n], m;

bool bor = false;
cout << n << " son kiriting:" << endl;

for (int i = 0; i < n; i ++){

cin >> a[i];

}
for (int i = 0; i < n; i ++){

for (int j = 0; j < n - 1; j ++){

if (a[j + 1] % 11 == 0){

bor = true;

if (a[j] % 11 == 0 && a[j] > a[j + 1]){

} else {

m = a[j + 1];

a[j + 1] = a[j];

a[j] = m;

}

}

}

}
if (bor)

cout << "Ro`yxatdagi eng katta 11 ga bo`linuvchi son: " << a[0];

else

cout << "Ro'yxatda 11 ga bo'linuvchi son yo'q";

}

7. Ketma-ket qidiruv usulidan foydalanib ro’yhatda har ikkinchi elementni qidiring va taqqoslashlar sonini aniqlang.

#include

using namespace std;

int main()

{

int n, manzil=-1, tr=0;

cout<<"massiv elementlar sonini kiriting: ";

cin>>n;

cout<<"massiv elementlarini kiriting:\n";

int k[n];

for(int i=0; i

{

cin>>k[i];

}

int key;

cout<<"izlayotgan sonni kiriting: ";

cin>>key;

for (int i=1; i

if (k[i]==key)

{

manzil = i+1;

tr++;

break;

}

else tr++;

cout<<"Taqqoslashlar soni: "<

cout<<"Izlanayotgan son massivning: "<

return 0;

}