Răspuns :
Buna seara! Uite aici rezolvarea problemei. Succes in continuare!
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int i;
bool found;
int v[9];
for (i = 0; i < 10; i++)
cin >> v[i];
do
{
found = true;
for (int j = 0; j < 9; j++)
{
if (v[j] > v[j + 1])
{
swap(v[j], v[j + 1]);
found = false;
}
}
} while (!found);
for (i = 0; i < 10; i++)
cout << v[i] << " ";
return 0;
}
#include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
int i;
bool found;
int v[9];
for (i = 0; i < 10; i++)
cin >> v[i];
do
{
found = true;
for (int j = 0; j < 9; j++)
{
if (v[j] > v[j + 1])
{
swap(v[j], v[j + 1]);
found = false;
}
}
} while (!found);
for (i = 0; i < 10; i++)
cout << v[i] << " ";
return 0;
}