13-19 guruh talabasi
SHodiyev Abdurahmon
SAVOL: A massiv elementlari qiymatlarini to’g’ridan-to’g’ri qo’shish usuli bilan saralash algoritmidan foydalanib kamayish tartibida saralab , eng kichik manfiy elementini ekranga chiqazuvshi dastur tuzing.
JAVOB:
#include
using namespace std;
int main ()
{
int n,a[100];
cout<<" Massiv elementlar sonini kiriting:n= ";cin>>n;
cout<<" Massiv elementlarini kiriting :"<
for(int i=0;i
{
cin>>a[i];
}
for(int k=1; k{
int z = a[k];
int j= k-1;
while(j>=0 && z >= a[j])
{
a[j+1] = a[j];
j = j-1;
}
a[j+1] = z;
}
cout<<"\nMassivning Saralangandan keyingi ko'rinishi \n";
for(int i=0;i
{
cout <} cout<
cout<<"Massivning eng kichik elementi= "<
}
Do'stlaringiz bilan baham: |