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 (replaced an asterisk (*) with a double dagger (‡).) |
m (added highlighting.) |
||
| (3 intermediate revisions 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>
All timings used the same (repeatable) identical set of random integers (by using a ''seed'' for the '''random''' BIF).
The integers were in the range of 0 ──► 100k, with every
Line 28 ⟶ 31:
════════ ════════════════════════
(‡) cocktail sort <b><big>÷</big></b> by
cocktail sort with shifting bounds
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.
| |||