Sorting algorithms/Stooge sort: Difference between revisions

Sorting algorithms/Stooge sort (view source)

13 bytes removed , 3 months ago

m

2,046

edits

Revision as of 16:47, 25 January 2024 (view source) imported>Arakov m (→‎{{header\|Elena}}) ← Older edit		Revision as of 23:00, 13 February 2024 (view source) Chkas (talk \| contribs) m (→‎{{header\|EasyLang}}) Newer edit →
(One intermediate revision by one other user not shown)
Line 702: =={{header\|EasyLang}}== <syntaxhighlight ~~lang=easylang~~> proc stsort left right . d[] . if d[left] > d[right] Line 715: . for i = 1 to 100 d[] &= ~~random~~randint 1000 . stsort 1 len d[] d[] Line 2,541: =={{header\|Wren}}== <syntaxhighlight lang="~~ecmascript~~wren">var stoogeSort // recursive stoogeSort = Fn.new { \|a, i, j\| if (a[j] < a[i]) { Line 2,556: } var asarray = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ] for (a in asarray) { System.print("Before: %(a)") stoogeSort.call(a, 0, a.count-1)