Anonymous user
Talk:Sorting algorithms/Cocktail sort with shifting bounds: Difference between revisions
Talk:Sorting algorithms/Cocktail sort with shifting bounds (view source)
Revision as of 13:52, 11 July 2021
, 2 years agoadded highlighting.
m (added clarification about the indentical set of random integers.) |
m (added highlighting.) |
||
| (One intermediate revision by the same user not shown) | |||
Line 2:
I did some timings (using the '''REXX''' program entries)
for the Rosetta Code
the ''cocktail sort with shifting bounds'' task.▼
::::::: ''cocktail sort task''
:::::::: <small> versus the </small>
Line 32 ⟶ 35:
For any amount of '''N''' integers <u>already
the timings were identical, and for the most part, the
times used by both sort versions weren't notable.
| |||