abażur

SORTOWANIE BĄBELKOWE

#include <iostream>
using namespace std;
int main()
{
const int max_n = 100;
int A[max_n], n;

cout << "Ile liczb chcesz posortować? (max=100) \n";
cin >> n;
cout << "Wprowadź liczby " << endl;
for (int i = 0; i < n; i++)
{
cout << "A[" << i << "] = ";
cin >> A ;
}

cout << "Tabela przed sortowaniem:" << endl;
for (int i = 0; i < n; i++)
cout << A << " ";

int i, j, pom;
for (i = 1; i <= n; i++)
{
for (j = n-1; j >= i; j--)
{
if (A[j] < A[j-1])
{
pom = A[j-1];
A[j-1] = A[j];
A[j] = pom;
}
}
}

cout << "\nTabela po sortowaniu:" << endl;
for (i = 0; i < n; i++)
cout << A << " ";
}