#define SWAP(A, B) { int t = A; A = B; B = t; }

void bubblesort(int *a, int n)
{
  int j, nn;

  do {
    nn = 0;
    for (j = 1; j < n; ++j)
      if (a[j-1] > a[j]) {
        SWAP( a[j-1], a[j] );
        nn = j;
      }
    n = nn;
  } while (n);
}

 long int fact(unsigned long int f)
{
     int i;
     unsigned long int result;
     if (f == 1 || f == 0)
           return 1;
     cout << "Шаг\t" << i << endl;
     i++;
     cout << "Результат: " << result << endl;
     result = f * fact(f - 1);
     return result;
}

 fact(int n)
{
    int i, f; 
    f == 1;
    for (i = 1; i <=n; i++) {
       f = f*i;
    }
    return f;
}