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

Content added Content deleted
(add task to arm assembly raspberry pi)
m (added a missing word to the task's preamble.)
Line 32: Line 32:
After   ''ii''   passes,   the first   ''ii''   and the
After   ''ii''   passes,   the first   ''ii''   and the
last   ''ii''   elements in the array are in their correct
last   ''ii''   elements in the array are in their correct
positions,   and don't to be checked (again).
positions,   and don't have to be checked (again).


By shortening the part of the array that is sorted each time,   the number of
By shortening the part of the array that is sorted each time,   the number of
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort_with_shifting_bounds"