Rosetta Code

Sorting algorithms/Cocktail sort with shifting bounds: Difference between revisions

Page Discussion

Sorting algorithms/Cocktail sort with shifting bounds (view source)

Revision as of 10:03, 29 June 2020

4 bytes added ,  3 years ago
m
C - rewrote swap function
m (added a blank.)
m (C - rewrote swap function)
Line 241:
 
void swap(char* p1, char* p2, size_t size) {
charfor (; tmp[size]-- > 0; ++p1, ++p2) {
memcpy( char tmp, p1,= size)*p1;
memmove( *p1, p2,= size)*p2;
memcpy( *p2, tmp,= size)tmp;
}
}
 
Simonjsaunders
1,777

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/300110"