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

m
replaced an asterisk (*) with a double dagger (‡).
m (changed wording of talk section name.)
m (replaced an asterisk (*) with a double dagger (‡).)
Line 18:
shifting bounds
times faster than
N a cocktail sort (*‡)
════════ ════════════════════════
1k 1.272
Line 28:
════════ ════════════════════════
 
(*‡) cocktail sort ÷ by
cocktail sort with shifting bounds