#include <stdio.h>
int swapcount =0;
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)
{
swapcount++;
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
for (size_t i = 0; i < n - 1; ++i) {
int count=0;
for (size_t j = 0; j < n - 1 - i; ++j) {
if (cmp( a[j] , a[j+1])) {
swap( &a[j] , &a[j+1] );
count=1;
}
}
if(count==0){
break;
}
}
for(size_t i=0;i<n;++i){
}
printf("swap関数の呼び出し回数%d",swapcount
); return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmludCBzd2FwY291bnQgPTA7CiBpbnQgY21wKGludCB4LCBpbnQgeSkgLy8gY29tcGFyZSB4IGFuZCB5CnsKcmV0dXJuIHggPiB5OyAvLyAxIGlmIHggPiB5LCAwIG90aGVyd2lzZQogfQogdm9pZCBzd2FwKGludCAqeCwgaW50ICp5KQogewpzd2FwY291bnQrKzsKIGludCB0bXAgPSAqeDsKCiAqeCA9ICp5OwogKnkgPSB0bXA7CgogfQoKaW50IG1haW4odm9pZCkKewppbnQgYVtdID0gezMsIDEsIDQsIDEsIDUsIDksIDIsIDYsIDV9OyAvLyBhcnJheSB0byBiZSBzb3J0ZWQKc2l6ZV90IG4gPSBzaXplb2YgYSAvIHNpemVvZiBhWzBdOyAvLyBudW1iZXIgb2YgZWxlbWVudHMKCmZvciAoc2l6ZV90IGkgPSAwOyBpIDwgbiAtIDE7ICsraSkgewoJaW50IGNvdW50PTA7CmZvciAoc2l6ZV90IGogPSAwOyBqIDwgbiAtIDEgLSBpOyArK2opIHsKCSBpZiAoY21wKCBhW2pdICwgIGFbaisxXSkpIHsKCQlzd2FwKCAmYVtqXSAsICZhW2orMV0gKTsKCQljb3VudD0xOwoJCQl9CgkJfQoJCWlmKGNvdW50PT0wKXsKCQlicmVhazsKCX0KfQoJCWZvcihzaXplX3QgaT0wO2k8bjsrK2kpewoJCQlwcmludGYoIiVkIixhW2ldKTsKfQoJCQlwcmludGYoIlxuIik7CgkJCXByaW50Zigic3dhcOmWouaVsOOBruWRvOOBs+WHuuOBl+WbnuaVsCVkIixzd2FwY291bnQpOwoJCQlyZXR1cm4gMDsKfQ==