O’zbekiston Respublikasi Axborot Texnologiyalari va Kommunikatsiyalarini Rivojlantirish Vazirligi

Dastur kodi

#include

#include

using namespace std;

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

{

int n; cout<<"talabalar sonini kiriting=";cin>>n;

struct table{

int t;

char FIO[20];

} talaba[n];

cout<

for(int i=0;i

talaba[i].t=i+1;

cin>>talaba[i].FIO;

}

int l=0;

for(int i=0;i

for(int j=n-1;j>i;j--){

if (strcmp(talaba[j-1].FIO,talaba[j].FIO)==1){

l++;

table k=talaba[j];

talaba[j]=talaba[j-1];

talaba[j-1]=k;

}

}

}

for(int i=0;i

cout<<"| "<

cout<<"bu algoritm jadvalni "<

system("PAUSE");

Topshiriq: Boshiga qo‘yish usulidan foydalanib ro‘yhatda 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.

#include

#include

#include

using namespace std;

struct Node{

int info;

Node *next;

};

int main(){

int n; cout<<"Nechta elementga egaa?"; cin>>n;

Node *lst=NULL;

Node *last=NULL;

//ro'yxatga elementlarni kiritish

for(int i=0;i

cout<

Node *p=new Node();

cin>>p->info;

p->next=NULL;

if(lst==NULL){

lst=p;

last=p;

} else{

last->next=p;

last=p;

}

}

Node *p=lst;

int k=0,Info[n];

for(int i=0;i

int sum=0;

int info=0;

p=lst;

for(int x=0;xp=p->next;

info=p->info;

}

for(int j=0;j

sum+=pow(p->info,2);

p=p->next;

}

if(sqrt(sum)<10){

Info[k]=info;

k++;

}

}

int max=Info[0];

if(k==1){

cout<

}

else if(k>1){

cout<<"O'zidan keyingi(O'zi bilan birga) sonlar yig'indisi 10dan kichik elementlar ko'p:\n";

for(int i=0;i

cout<

if(max

max=Info[i];

}

}

cout<<"\nBunday sonlardan eng kattasi "<

} else cout<<"O'zidan keyingi sonlar kvadratik yig'indisi 10dan kichik elementlar yo'q";

}


}

Topshiriq: Talabalarni birinchi va ikkinchi imtihoni natijalari bo‘yicha kamayish tartibida.

// Talabalarni birinchi va ikkinchi

// imtihoni natijalari bo'yicha kamayish tartibida.

#include

#include

#include

using namespace std;

class talaba {

public:

string name;

int ball1, ball2;

int getbal1(){

return ball1;

}

int getbal2 (){

return ball2;

}

void gettalaba(){

cout<

}

};

int main (){

int n;

cout<<" Talabalar sonini kiriting -> "; cin>>n;

talaba t[n],a;

//ma'lumotlarni kiritish

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

cout<

cout<<" ismi "; cin>>t[i].name;

cout<<" 1-imtihon balini kiriting " ; cin>>t[i].ball1;

cout<<" 2-imtihon balini kiriting "; cin>>t[i].ball2;

}

//balli bo'yicha saralash

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

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

if ((t[i].getbal1()+t[i].getbal2())>= (t[j].getbal1()+t[j].getbal2())) {

a=t[j]; t[j]=t[i]; t[i]=a;

}

}

}

//tahrirlangan ma'lumotlarni erkranga chiqarish

cout<

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

t[i].gettalaba();

}

system("pause");

}

Savol:

Ketma-ket qidiruv usulidan foydalanib, ro‘yhat eng kichik elementini toping.

Dastur kodi:

#include

#include

using namespace std;

int search(int a[], int N)

{int i=0;

int min_value = a[0];

for (i=0; i
for (int j=0; j
if(min_value > a[j]) {

min_value = a[j]; }} }

return min_value;}

main ()

{ int i, N, mas[1000], key, P;

cout<<"Ro'yxat uzunligini kiriting!"<
cin>>N;

cout<<"Ro'yxat elementlarini kiriting!"<
for (i=0; i
cin>>mas[i];

P=search(mas,N);

cout << "Eng kichik elementi : " << P << endl;

getch();

return 0;}

Dastur natijasi: