#include <stdio.h>
 
int cmp(int x, int y) // compare x and y
{
    return x > y; // 1 if x > y, 0 otherwise
}
 
void swap(int *x, int *y)
{
    int tmp = *x;
 
    *x = *y;
    *y = tmp;
}
 
int main(void)
{
    int a[] = {3, 1, 4, 1, 5, 9, 2, 6, 5}; // array to be sorted
    size_t n = sizeof a / sizeof a[0]; // number of elements
    int count=0;
   for (size_t i = 0; i < n - 1; ++i) {
   int kakunin=0;
       for (size_t j = 0; j < n - 1 - i; ++j) {
           if (cmp(a[j] ,a[j+1])) {
              swap(&a[j],&a[j+1]);
              kakunin=1;
              count++;
 }
}
   if(kakunin==0){
     break;
 }
}
 
    for (size_t i = 0; i < n; ++i) {
        printf("%d ", a[i]);
    }
    printf("\n");
    printf("swap関数は%d回繰り返されます",count);
 
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgY21wKGludCB4LCBpbnQgeSkgLy8gY29tcGFyZSB4IGFuZCB5CnsKICAgIHJldHVybiB4ID4geTsgLy8gMSBpZiB4ID4geSwgMCBvdGhlcndpc2UKfQoKdm9pZCBzd2FwKGludCAqeCwgaW50ICp5KQp7CiAgICBpbnQgdG1wID0gKng7CgogICAgKnggPSAqeTsKICAgICp5ID0gdG1wOwp9CgppbnQgbWFpbih2b2lkKQp7CiAgICBpbnQgYVtdID0gezMsIDEsIDQsIDEsIDUsIDksIDIsIDYsIDV9OyAvLyBhcnJheSB0byBiZSBzb3J0ZWQKICAgIHNpemVfdCBuID0gc2l6ZW9mIGEgLyBzaXplb2YgYVswXTsgLy8gbnVtYmVyIG9mIGVsZW1lbnRzCiAgICBpbnQgY291bnQ9MDsKICAgZm9yIChzaXplX3QgaSA9IDA7IGkgPCBuIC0gMTsgKytpKSB7CiAgIGludCBrYWt1bmluPTA7CiAgICAgICBmb3IgKHNpemVfdCBqID0gMDsgaiA8IG4gLSAxIC0gaTsgKytqKSB7CiAgICAgICAgICAgaWYgKGNtcChhW2pdICxhW2orMV0pKSB7CiAgICAgICAgICAgICAgc3dhcCgmYVtqXSwmYVtqKzFdKTsKICAgICAgICAgICAgICBrYWt1bmluPTE7CiAgICAgICAgICAgICAgY291bnQrKzsKIH0KfQogICBpZihrYWt1bmluPT0wKXsKICAgICBicmVhazsKIH0KfQoKICAgIGZvciAoc2l6ZV90IGkgPSAwOyBpIDwgbjsgKytpKSB7CiAgICAgICAgcHJpbnRmKCIlZCAiLCBhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKICAgIHByaW50Zigic3dhcOmWouaVsOOBryVk5Zue57mw44KK6L+U44GV44KM44G+44GZIixjb3VudCk7CgogICAgcmV0dXJuIDA7Cn0=