Anonymous user
Sorting algorithms/Cocktail sort: Difference between revisions
→{{header|C}}: C code now looks more like C rather than like pascal, java or anything else.
m (range optimisation missing) |
(→{{header|C}}: C code now looks more like C rather than like pascal, java or anything else.) |
||
Line 334:
<lang c>#include <stdio.h>
// can be any swap function. This swap is optimized for numbers.
void swap(int *x, int *y) {
if(x == y)
return;
void cocktailsort(int *a, size_t len)▼
*x ^= *y;
}
while (!t) {▼
for (i = 1, t = 1; i < len; i++) try_swap;▼
// packing two similar loops into one
char flag;
size_t start[2] = {1, n - 1},
end[2] = {n, 0},
inc[2] = {1, -1};
flag = 1;
for(int i = start[it]; i != end[it]; i += inc[it])
if(a[i - 1] > a[i]) {
swap(a + i - 1, a + i);
flag = 0;
}
if(flag)
return;
}
}
}
int main(void) {
▲ int x[] = { 5, -1, 101, -4, 0, 1, 8, 6, 2, 3 };
▲ size_t i, len = sizeof(x)/sizeof(x[0]);
cocktailsort(
for (size_t i = 0; i <
printf("%d
return 0;
}</lang>
'''Output''':
<lang>-4 -1 0 1 2 3 5 6 8 101</lang>
=={{header|C++}}==
| |||