Rosetta Code

Sorting algorithms/Cocktail sort: Difference between revisions

Page Discussion

Sorting algorithms/Cocktail sort (view source)

Revision as of 18:57, 29 July 2011

189 bytes removed ,  12 years ago
→‎{{header|C}}: cleanup
m ({{omit from|GUISS}})
(→‎{{header|C}}: cleanup)
Line 263:
=={{header|C}}==
<lang c>#include <stdio.h>
#include <stdbool.h>
 
#define COCKTSORT try_swap { if (a[i] < a[i - 1])\
if { (t = a[i]; >a[i] = a[i+ - 1]; )a[i { \- 1] = t; t = 0;} }
int temp = a[i]; \
a[i] = a[i+1]; \
a[i+1] = temp; \
swapped = true; \
}▼
 
void cocktailsort(int *a, unsigned int llen)
{
int i, bool swappedt = false0;
while (!t) {
int i;
for (i = t = 1; i < len; i++) try_swap;
 
if (!t) for (i = llen - 2;1, it >= 01; i; i--) {try_swap;▼
do {
}
for(i=0; i < (l-1); i++) {
▲}
COCKTSORT;
}
if ( ! swapped ) break;
swapped = false;
▲ for(i= l - 2; i >= 0; i--) {
COCKTSORT;
}
} while(swapped);
}</lang>
<lang c>int array[10] = { 5, -1, 101, -4, 0,▼
1, 8, 6, 2, 3 };
 
int main()
{
▲<lang c> int arrayi, x[10] = { 5, -1, 101, -4, 0, 1, 8, 6, 2, 3 };
int i;
int len = sizeof(x)/sizeof(x[0]);
 
cocktailsort(arrayx, 10len);
for (i = 0; i < 10len; i++) {
printf("%d\n", arrayx[i]);
return 0;
}
}</lang>
 
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/89037"