Sorting algorithms/Cocktail sort with shifting bounds: Difference between revisions
Sorting algorithms/Cocktail sort with shifting bounds (view source)
Revision as of 16:54, 26 June 2020
, 4 years agoC++ - removed unnecessary braces
(Added C++ solution) |
m (C++ - removed unnecessary braces) |
||
Line 275:
return;
std::cout << *begin++;
while (begin != end)
std::cout << ' ' << *begin++;
std::cout << '\n';
}
| |||