Sorting algorithms/Bogosort: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 04:0104:01, 18 August 2018‎ rosettacode>Jenniferleigh‎ m 64,152 bytes +3‎ →‎{{header|Rust}}

curprev 14:3814:38, 29 July 2018‎ Thundergnat talk contribs‎ m 64,149 bytes −94‎ →‎{{header|Ring}}: Remove vanity tags

curprev 14:5614:56, 28 May 2018‎ rosettacode>Stan 2018‎ 64,243 bytes +415‎ No edit summary

curprev 08:0508:05, 17 February 2018‎ CalmoSoft talk contribs‎ 63,828 bytes −125‎ →‎{{header|Ring}}
curprev 07:5907:59, 17 February 2018‎ CalmoSoft talk contribs‎ 63,953 bytes +1,294‎ No edit summary

curprev 11:4011:40, 20 January 2018‎ rosettacode>Gpapo‎ 62,659 bytes −410‎ →‎{{header|Julia}}

curprev 17:4817:48, 15 November 2017‎ rosettacode>Cogier‎ m 63,069 bytes +48‎ No edit summary
curprev 17:4217:42, 15 November 2017‎ rosettacode>Cogier‎ 63,021 bytes +1,341‎ No edit summary

curprev 09:1609:16, 2 October 2017‎ rosettacode>Arakov‎ 61,680 bytes +519‎ →‎{{header|Eiffel}}

curprev 22:4422:44, 20 September 2017‎ rosettacode>Mattmahn‎ m 61,161 bytes +19‎ Add reference to Rust rand library

curprev 08:0808:08, 19 May 2017‎ rosettacode>Dmitry Kandalov‎ 61,142 bytes 0‎ →‎{{header|Kotlin}}: Updated example see https://github.com/dkandalov/rosettacode-kotlin for details

curprev 11:2511:25, 12 April 2017‎ PureFox talk contribs‎ 61,142 bytes +901‎ Added Kotlin

curprev 00:4600:46, 31 December 2016‎ rosettacode>Spoon!‎ m 60,241 bytes −28‎ →‎{{header|Haskell}}: don't need another case

curprev 14:1814:18, 30 December 2016‎ rosettacode>Crossrodas1112‎ 60,269 bytes +22‎ →‎{{header|Rust}}: Made calls a little more intuitive
curprev 00:1100:11, 30 December 2016‎ rosettacode>Crossrodas1112‎ 60,247 bytes +141‎ →‎{{header|Haskell}}

curprev 23:5123:51, 29 December 2016‎ rosettacode>Crossrodas1112‎ 60,106 bytes +28‎ →‎{{header|Rust}}
curprev 19:3719:37, 29 December 2016‎ rosettacode>Crossrodas1112‎ 60,078 bytes +21‎ →‎{{header|Rust}}: Previous example was rife with unnecessary allocations and was not generic

curprev 17:1617:16, 30 September 2016‎ rosettacode>Schmonz‎ 60,057 bytes +44‎ →‎{{header|Rust}}: Add requirements
curprev 13:5013:50, 30 September 2016‎ rosettacode>Schmonz‎ 60,013 bytes −196‎ →‎{{header|Rust}}: Replaced with shuffle-based algorithm

curprev 19:5719:57, 29 September 2016‎ rosettacode>Schmonz‎ 60,209 bytes +782‎ First draft for Rust solution

curprev 17:2817:28, 6 September 2016‎ rosettacode>Gerard Schildberger‎ m 59,427 bytes +8‎ added a ;Task: (bold) header.
curprev 10:5010:50, 6 September 2016‎ Edmund talk contribs‎ 59,419 bytes +2,655‎ Added COBOL

curprev 00:1900:19, 4 July 2016‎ rosettacode>Gerard Schildberger‎ m 56,764 bytes +70‎ added whitespace before the TOC (table of contents), added other whitespace to the task's preamble.

curprev 12:4012:40, 3 July 2016‎ rosettacode>Vonjd‎ m 56,694 bytes −7‎ you don't need to use print function to print result of function
curprev 12:3912:39, 3 July 2016‎ rosettacode>Vonjd‎ 56,701 bytes −45‎ you don't have do create a function for checking if a vector is sorted because there is a function for that already