4-amaliy mashg’uloti. Bog'langan ro'yxat. Saralash masalalari. Qidiruv usullari. Daraxtlar bilan ishlash masalalari

4.2-amaliy mashg’ulot. Qidiruv usullari


1-misol. Binar qidiruv usulidan foydalanib massiv elementlari orasida belgilangan elementni qidirish dasturi quyida keltirilgan:
1-usul.

#include

#include

int Binsearch(int a[], int N, int key, int *t)

{

int l=0, r=N-1, mid=(l+r)/2;

while (l<=r)

{ *t+=1;

if (a[mid]==key) return mid;

if (a[mid]>key) r=mid-1;

else l=mid+1;

mid=(l+r)/2;

}

a[N]=key;

return N;

}

main ()

{

int i, N, mas[1000], key, P, t=0; cout<>N;

cout<<"Massiv elementlarini kiriting!"<

for (i=0; i

cin>>mas[i];

cout<<"Qidiruv elementini kiriting!"<

cin>>key;

P=Binsearch(mas,N,key, &t);

if (P==N) cout<<"Bunday elementni massivga qo'shis lozim"<<" "<

else cout<<"Bunday element bor"<<" "<

getch();

return 0;

}

2-usul.

#include

#include

int InSeqsearch(int realArray[], int N, int kind[2][1000],int m,int key,

int *t)

{

int i=0,

low = 0,

hi = 0;

while ((i

{

i++;

(*t)++;

}

(*t)++;

if (i==0)

low=0;

else

low=kind[1][i-1];

if (i==m)

hi=N;

else

hi=kind[1][i]-1;

for (int j=low; j<=hi; j++)

{

(*t)++;

if( key==realArray[j] )

{

return j;

}

}

return -1;

}

main ()

{

int i = 0 ,

N=0,

mas[1000] = {0},

kind[2][1000] = {0},

key = 0,

P=0,

index = 0,

kindIndex = 0,

t = 0;

cout<>N;
cout<<"Massiv elementlarini kiriting!"<

for (i=0; i

cin>>mas[i];

cout<<"Qidiruv elementini kiriting!"<>key;

cout<<"Boshlangich qadamni kiriting! "<>P;

1. 
   = P-1; while(i

{

kind[0][kindIndex] = mas[i]; kind[1][kindIndex++] = i;

1. 
   += P;
   

}

index = InSeqsearch(mas,N,kind,kindIndex,key, &t);

if (index == -1)

cout<<"Bunday element massivda yuq "<< index <<" "<

cout<<"Bunday element bor"<<" "<

getch();

return 0;

}

3-usul.

#include

#include

#include

#include

struct TNode {

int value;

TNode* pnext;

};

//Ro'yhatga element qo'shish

void add2list(TNode **pphead, int val) {

TNode **pp = pphead, *pnew;

pnew = new TNode;

pnew->value=val;

pnew->pnext = *pp;

*pp = pnew;

}

//Ro'yhat elementlarini ekranga chiqarish

void print(TNode *phead)

{

TNode* p = phead;

while(p) {

cout <<" "<< p->value<<"-> ";

16. 
    = p->pnext;
    

}

cout << endl;

}

• 
  Ro'yhatda element qidirish, C++
  

TNode* Find(TNode *phead, int x)

{

TNode *p=phead;

while(p)

if (p->value==x) return p;

else p = p->pnext;

return 0;

}

//Ro'yhat elementini o'chirish

void deleteList(TNode *phead) {

if(phead) {

deleteList(phead->pnext);

if(phead)

delete phead;

}

}

//Asosiy qism

int main() {int mas[1000], N, key; TNode* T;

clrscr();

TNode *phead = 0;

cout<<"Ro’yhat uzunligini kirit"<

cin>>N;

cout<<"Elementlarni kirit!"<

for(int j=0; j

cin>>mas[j];

for(int i = 0; i < N; ++i)

add2list(&phead,mas[i]);

cout<<"Qidiruv elementni kiriting!"<

cin>>key;

cout << "Elements of the list:" << endl;

print(phead);

T=Find(phead,key);

if (T==0) cout <<"Bunday element yoq"<

else cout <<"Bunday element bor"<<" "<value<<"

"<

//deleteList(phead);

getch();

return 0;

}

4-usul.

#include

#include

int search(int a[], int N, int key, int *t)

{

int i=0;

while (i!=N)

{*t+=1;

if (a[i]==key) return i;

else i++;

}

//a[N]=key;

return -1;

}

main ()

{

int i, N, mas[1000], key, P, t=0; cout<>N;

cout<<"Massiv elementlarini kiriting!"<

for (i=0; i

cin>>mas[i];

cout<<"Qidiruv elementini kiriting!"<

cin>>key;

P=search(mas,N,key,&t);

if (P==-1) cout<<"Bunday elementni massivga qo'shis lozim"<<" "<

else cout<<"Bunday element bor"<<" "<

getch();

return 0;

}

2-topshiriq

1–variant. Ketma-ket qidiruv usulidan foydalanib, A massiv eng kichik elementini toping.

2–variant. A massiv berilgan, A massivdagi elementlar orasidan 30 dan katta elementlarni toping.

3–variant. Ketma-ket qidiruv usulidan foydalanib, A massiv elementlari orasidan 3 (3,6,9, ...) ga karralilarini ekranga chiqaring.

4–variant. Ketma-ket qidiruv usulidan foydalanib moduli 20 dan katta va 50 dan kichik elementlarni toping.

5–variant. Ketma-ket qidiruv usulidan foydalanib, A massiv elementlari orasidan 4 (4,8,...) ga karralilarini ekranga chiqaring.

6–variant. Ketma-ket qidiruv usulidan foydalanib 50 dan katta sonlarni ekranga chiqaring.

7–variant. Ketma-ket qidiruv usulidan foydalanib, A massivda elementni va taqqoslashlar sonini toping.

8–variant. Binar qidiruvdan foydalanib elementlarni tasodifiy ravishda toping.

9–variant. Mashina raqamlari ro’yxati berilgan: 345, 368, 876, 945, 564, 387, 230. Binar qidiruvdan foydalanib berilgan raqamli mashina qaysi joyda turganini toping.

10–variant. Ro’yxatda har ikkinchi elementni qidiring va taqqoslashalr sonini aniqlang.

11–variant. Binar qidiruvdan foydalanib berilgan kalitli elementni toping.

Butun sonlar massivi berilgan. Boshiga qo’yish va transpozisiya usuliga prosedura tuzilsin. Berilgan masalani yeching va masalada har ikkala usulda topilgan elementni ro’yxat boshiga joylashtiring.

12–variant. Berilgan massiv elementlari ichidan eng katta elementni topilsin.

13–variant. Berilgan massiv elementlari ichidan eng kichik elementni topilsin.

14–variant. 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).

15–variant. 11 ga butun bo’linuvchi eng katta sonni toping (agar bunday sonlar ko’p bo’lsa, u holda ularning eng kichigini toping; agar bunday son mavjud bo’lmasa – shunga mos ma’lumot chiqaring).

16–variant. Qo’shni elementlari ayirmasi 72 dan kichik bo’lgan elementni toping. Agar bunday elementlar ko’p bo’lsa, u holda ularning eng kattasini toping; agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

17–variant. Qo’shni elementlari bo’linmasi juft son bo’lgan elementni toping. Agar bunday elementlar ko’p bo’lsa, u holda ularning eng kattasi ѐki eng kichigini toping; agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

18–variant. Qo’shni elementlar ayirmasi juft bo’lgan elementni toping. Agar bunday elementlar ko’p bo’lsa, u holda ularning eng kattasi ѐki eng kichigini toping; agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

19–variant. Kerakli elementgacha bo’lgan elementlarning o’rta arifmetigi 12 ga teng bo’lgan element topilsin. Agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

20–variant. 10 bo’linuvchi maksimal elementni toping. Agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

21–variant. Qo’shni elementlari ayirmasi juft va 3 ga bo’linadigan elementni toping. Agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

22–variant. Kerakli elementdan keyingi elementlarning o’rtacha kvadratik qiymati 10 dan kichik bo’lgan elementni toping. Agar bunday

elementlar ko’p bo’lsa, u holda ularning eng kattasini toping; agar bunday element mavjud bo’lmasa – shunga mos ma’lumot chiqaring.

23–variant. Har bir x element uchun tg(x) qiymatini aniqlang va eng katta qiymatga ega bo’lgan elementni 1-chi o’ringa qo’ying.