This definitely looks like a better candidate for a bubble sort, and it looks like it was taken directly (with expansion of the swap function/macro) from your "Bubble sort misconceptions" link under the introduction of "Actual bubble sort looks like this:".
Let's compare this to wufflz's code from post #1, with variable renaming, reformatting, etc for easier equivalence checking:
Code:
void arraySortieren(int a[], size_t n)
{
size_t i, j;
for (int i = n; i > 1; --i) {
for (int j = 0; j < n - 1; ++j) {
if (a[j] < a[j + 1]) {
int t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
}
In your version, the outer loop starts i from n-1 and loops down until it reaches 0, whereas in wufflz's version, i starts from n and loops down until it reaches 1. Because wufflz's code is extra inefficient in that it doesn't use i in the inner loop, this makes the outer loop effectively identical to yours: its only function is to loop n-1 times, so we could just as well have changed it to your version.
In your version, the inner loop loops j from 0 to i. In wufflz's version, the inner loop loops j from 0 to n-1. What this means is that whatever swaps occur will be exactly the same in the same order. wufflz's version just does extra unnecessary comparison of items that have already been sorted.
Consequently, it looks like these two sorts are the same kind of sort, whatever it is.