Guruh talabasi Rajabov Islombek

914_19-guruh talabasi

Rajabov Islombek

Topshiriq

Pufaksimon saralash usulidan foydalanib, saralashni amalga oshirish dasturini ishlab chiqish (variantga mos ravishda):

1. 
   A massivning eng katta (eng kichik) elementini ekranga chiqarish dasturini tuzing.
   

#include

using namespace std;

int main(){

int n;

cout<<"n = ";

cin>>n;

int a[100];

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

cin >> a[i];

}

int min = a[1];

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

if (a[i] < min)

min = a[i];

}

int max= a[1];

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

if (a[i] > max)

max = a[i];

}

cout << "Massivning minimali : " << min<

cout<<"Massivning maxsimali : "<

}

2. 
   A massiv elementlari qiymatlarini kamayish tartibida saralash dasturini tuzing.
   

#include

using namespace std;

void saralash (int a[], int n){

int i,j;

for(i=0; ifor(j=0; j

if(a[i]>a[j]) swap(a[i],a[j]);
}

}

}

int main(){

int i,n;

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

int a[n];

cout<

for(i=0; i>a[i];

cout<<" Kamayish tartibida saralangan massiv.\n";

saralash(a,n);

for(i=0; i

system("pause");

return 0;

}

3. 
   A massivda elementlar berilgan. Mazkur massiv elementlaridan shunday V massiv shakllantiruvchi shunday dastur tuzingki, V massiv elementlari kamayish tartibida saralangan bo’lsin.
   

#include

using namespace std;

void saralash (int a[], int n){

int i,j;

for(i=0; i

for(j=0; j

if(a[i]>a[j]) swap(a[i],a[j]);

}

}

}

int main(){

int i,n;

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

int a[n];

cout<

for(i=0; i>a[i];

cout<<" V massiv.\n";

saralash(a,n);

for(i=0; i

system("pause");

return 0;

}

5. Elementlari o„sish tartibida joylashgan A massivni, elementlari kamayish tartibida joylashgan massiv ko’rinishida tez quruvchi dastur tuzing.

#include
	using namespace std;
	int main()
	{
	int A[] = {0, 1, 3, 5, 8, 9};
	int n = sizeof(A) / sizeof(A[0]);
	sort(A, A + n, greater());
	cout << "Kamayish tartibida saralandi! ";
	for (int i = 0; i < n; ++i)
	cout << A[i] << " ";
	return 0;
	}