#pragma argsused #include #pragma hdrstop #include

//---------------------------------------------------------------------------

#pragma argsused

#include

#pragma hdrstop

#include

#include

//---------------------------------------------------------------------------

struct oquvchi

{

string fam;

string ismi;

int sinfi;

char h;

};

int main()

{ const int n=4;

oquvchi a[n],b[40],p;

int i,j,k;

for(i=0;i

{cin>>a[i].fam;

cin>>a[i].ismi;

cin>>a[i].sinfi;

cin>>a[i].h;

}

k=0;

for(i=0;i

if((a[i].sinfi==9)&&(a[i].h=='a'))

{b[k]=a[i];k=k+1;}

for(i=0;i

for(j=i+1;j

if(b[i].fam>b[j].fam){p=b[i];b[i]=b[j];b[j]=p;}

cout<<"\n 9 a sinf o'quvchilarining ro'yxati \n\n";

for(i=0;i

cout<

b[i].ismi<<" "<

getch();

return 8;

}

//---------------------------------------------------------------------------__include'>Eng yosh talabani topish.

//---------------------------------------------------------------------------

#include

#pragma hdrstop

#include

#include

#pragma argsused

//---------------------------------------------------------------------------

struct sana {int kun,oy,yil;};

sana yosh( sana *a, int m);

int main(int argc, char* argv[])

{ sana *b, p;

int i,n;

cin>>n;

b=new sana[n];

for(i=0;i

cin>>b[i].kun>>b[i].oy>>b[i].yil;

p=yosh(b,n);

cout<<"\n\n eng kichik ="<


getch();

return 0;

}

//---------------------------------------------------------------------------

sana yosh( sana *a,int m)

{ int i; sana p;

p=a[0];

for(i=1;i

if(p.yil

else if((p.yil==a[i].yil) && (p.oy

else if((p.oy==a[i].oy) && (p.kun

return p;

}

K1 karta K2 kartani uradimi yoki yo’qmi.

//---------------------------------------------------------------------------

#include

#include

#include

#pragma hdrstop

#pragma argsused

//--------------------------------------------------------------------------

enum rasm {piki,trefi,bubni,chervi};

enum nom {olti,etti,sakkiz,toqqiz,on,valet,dama,karol,tuz};

struct karta {

rasm r;

nom n;

};

//-------------------------------------------------------------------------

bool uradi(karta k1,karta k2,rasm kz);

//-------------------------------------------------------------------------

int main(int argc, char* argv[])

{

rasm kz;

karta k1,k2;

k1.n=karol; k1.r=piki;

k2.n=dama; k2.r=piki;

kz=piki;

if (uradi(k1,k2,kz)) cout<<" uradi ";

else cout<<" urmaydi ";

getch();

return 0;

}

//---------------------------------------------------------------------------

bool uradi(karta k1,karta k2,rasm kz)

{ bool t=false;

if((k1.r==k2.r) && (k1.n>k2.n)) t=true;

if ((k1.r==kz) && (k2.r!=kz)) t=true;

if ((k2.r==kz) && (k1.r==kz) && (k1.n>k2.n)) t=true;

return t;

}

Ma'ruza 2. Algoritmlarni tahlil qilish

"A" shahardan "B" shaharga borish uchun uni turli yo'llar bilan amalga oshirish mumkin: samolyotda, avtobusda, poezdda, shuningdek velosipedda.

Qulayligiga qarab, bizga maqul bo’lgan yo’lni tanlaymiz .

Xuddi shunday, informatikada ham bir xil masalani echish uchun bir nechta algoritmlar mavjud (masalan, saralash masalasida insert sort, select sort, quick sort va boshqalar kabi ko'plab algoritmlar mavjud ) .

Algoritmlarni tahlili qaysi algoritm egallagan vaqt va makon jihatidan eng samarali ekanligini aniqlashga yordam beradi .

Algoritm tahlilining maqsadi algoritmlarni (yoki echimlarni) asosan ish vaqti va boshqa omillar (masalan, xotira hajmi, algoritmning murakkabligi va boshqalar) bo'yicha taqqoslashdir .