#include <stdio.h>
#define N 5
void bsort(int a[], int n) {
int t;
int flag_sorted;
int i, j;
i = 0;
do {
flag_sorted = 1;
for (j = n - 1; j > i; j--)
if (a[j] < a[j - 1]) {
t = a[j];
a[j] = a[j - 1];
a[j - 1] = t;
flag_sorted = 0;
}
i++;
} while (!flag_sorted);
}
int main() {
int a[N], t;
int i, j;
for (i = 0; i < N; i++) {
for (;;) {
printf("%d > ", i + 1);
scanf("%d", &t);
for (j = 0; j < i; j++)
if (t == a[j])
break;
if (j < i)
continue;
a[i] = t;
break;
}
}
for (i = 0; i < N; i++)
printf("a[%d] = %d\n", i, a[i]);
bsort(a, N);
printf("sorted:\n");
for (i = 0; i < N; i++)
printf("a[%d] = %d\n", i, a[i]);
return 0;
}
/* end */