Sorting algorithms/Insertion sort: 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 18:5218:52, 23 August 2011‎ 99.231.216.46 talk‎ 40,082 bytes +20‎ →‎{{header|C}}: need stddef for size_t
curprev 18:5118:51, 23 August 2011‎ 99.231.216.46 talk‎ 40,062 bytes +6‎ →‎{{header|C}}: add static
curprev 18:5018:50, 23 August 2011‎ 99.231.216.46 talk‎ 40,056 bytes +38‎ →‎{{header|C}}: size should be an unsigned int, size_t is even better because it uses the proper size for your architecture (32-bit on x86, 64-bit on x86_64)

curprev 17:1017:10, 22 August 2011‎ 99.231.216.46 talk‎ 40,018 bytes +2‎ →‎{{header|C}}: make function declaration valid

curprev 11:0311:03, 8 August 2011‎ rosettacode>Insolor‎ 40,016 bytes +793‎ →‎{{header|Euphoria}}: Euphoria example added

curprev 19:0019:00, 19 July 2011‎ rosettacode>Gregmchapman‎ 39,223 bytes +653‎ Added Nemerle

curprev 06:4106:41, 13 July 2011‎ rosettacode>Markhobley‎ m 38,570 bytes +21‎ {{omit from|GUISS}}

curprev 13:0513:05, 1 June 2011‎ Toucan talk contribs‎ 38,549 bytes +264‎ →‎{{header|Fortran}}: intent, :: and free-form are not part of fortran 77 ! Here still using extension "implicit none", defined by mil-std-1753, and I don't know for short-circuit

curprev 10:3410:34, 25 May 2011‎ rosettacode>ADub‎ 38,285 bytes +621‎ {{header|Liberty BASIC}}

curprev 04:2604:26, 24 May 2011‎ rosettacode>CRGreathouse‎ 37,664 bytes +185‎ GP

curprev 19:2619:26, 11 May 2011‎ rosettacode>IanOsgood‎ 37,479 bytes 0‎ →‎{{header|Javascript}}: sp

curprev 20:2320:23, 8 May 2011‎ rosettacode>Sergworks‎ 36,308 bytes −1‎ →‎{{header|Delphi}}
curprev 19:3619:36, 8 May 2011‎ rosettacode>Sergworks‎ 36,309 bytes +450‎ →‎{{header|E}}

curprev 20:3120:31, 2 May 2011‎ rosettacode>Trap D‎ 35,859 bytes +614‎ →‎{{header|Prolog}}

curprev 15:5615:56, 18 March 2011‎ rosettacode>Jg‎ 35,245 bytes −70‎ →‎{{header|Javascript}}: An insertion sort should have the property that nearly sorted lists sort in linear time and the splice method didnt work that way.
curprev 15:4815:48, 18 March 2011‎ rosettacode>Jg‎ 35,315 bytes −15‎ →‎{{header|Perl}}: Use a range instead of a for loop on $i
curprev 00:5900:59, 18 March 2011‎ rosettacode>Jg‎ 35,330 bytes −28‎ →‎{{header|Perl}}: an insertion sort should become O(n) when already sorted so the splice method from before wouldnt be good.
curprev 00:4600:46, 18 March 2011‎ rosettacode>Jg‎ 35,358 bytes −5‎ →‎{{header|C}}: Keep indexing the same as the shell sort

curprev 19:1619:16, 16 March 2011‎ 208.74.121.102 talk‎ 35,363 bytes +35‎ →‎{{header|Perl}}: Rather not use a statement label if I can help it
curprev 19:0319:03, 16 March 2011‎ 208.74.121.102 talk‎ 35,328 bytes +429‎ Add javascript example
curprev 18:1918:19, 16 March 2011‎ 208.74.121.102 talk‎ 34,899 bytes −17‎ I thought the sub should be more similar to the builtin sort by taking an array not a ref to one and return a copy
curprev 17:0817:08, 16 March 2011‎ 208.74.121.102 talk‎ 34,916 bytes −102‎ Fixed a few naming and operator issues. "Isort" to "insertion_sort". "i <= n - 1" to "i < n". "j -= 1" to "j--". That sort of thing.

curprev 05:2705:27, 4 March 2011‎ rosettacode>Balrog‎ 35,018 bytes +343‎ →‎{{header|Groovy}}: swap dots added
curprev 02:1502:15, 4 March 2011‎ rosettacode>Balrog‎ 34,675 bytes +723‎ →‎{{header|Groovy}}: new solution

curprev 18:4118:41, 2 March 2011‎ 95.245.212.160 talk‎ 33,952 bytes −15‎ Cleaned D code

curprev 15:0615:06, 16 February 2011‎ rosettacode>Kevin Reid‎ 33,967 bytes +468‎ Undo revision 101335 by 208.80.119.67 (talk) — For this task, I think it is more to the point to have the algorithm

curprev 19:3219:32, 14 February 2011‎ rosettacode>Blastfurnace‎ 33,499 bytes 0‎ →‎{{header|C++}}: Using std::upper_bound keeps this sort stable in the presence of equal keys and may be faster.
curprev 07:5507:55, 14 February 2011‎ Sonia talk contribs‎ 33,499 bytes +584‎ Go solution

curprev 04:4804:48, 10 February 2011‎ 208.80.119.67 talk‎ 32,915 bytes −468‎ →‎Insertion sort with binary search

curprev 03:2803:28, 1 February 2011‎ rosettacode>Dgamey‎ m 33,383 bytes −62‎ →‎Icon and Unicon: header simplification

curprev 20:0520:05, 15 January 2011‎ Eriksiers talk contribs‎ m 33,445 bytes −80‎ moved realbasic back to its own section; minor markup edits to rexx

curprev 02:2002:20, 28 November 2010‎ rosettacode>Gerard Schildberger‎ m 33,525 bytes 0‎ →‎{{header|REXX}}

curprev 20:5020:50, 27 November 2010‎ rosettacode>Gerard Schildberger‎ m 33,525 bytes +3,607‎ →‎{{header|R}}

curprev 17:2617:26, 22 November 2010‎ rosettacode>Abu‎ 29,918 bytes +302‎ Added PicoLisp

curprev 10:4010:40, 20 November 2010‎ Toucan talk contribs‎ 29,616 bytes +361‎ adding GAP

curprev 19:0719:07, 3 November 2010‎ Util talk contribs‎ 29,255 bytes +470‎ →‎{{header|Perl 6}}: Added Perl 6 solution

curprev 10:3510:35, 28 October 2010‎ Objeck talk contribs‎ 28,785 bytes +545‎ No edit summary

curprev 21:4521:45, 17 October 2010‎ rosettacode>Sekoia‎ 28,240 bytes +289‎ added Yorick

curprev 08:2608:26, 13 September 2010‎ rosettacode>Dkf‎ m 27,951 bytes +29‎ Mark as using wikipedia content (the algorithm description)

curprev 18:4218:42, 11 September 2010‎ rosettacode>Dgamey‎ 27,922 bytes −147‎ →‎{{header|Icon}}: brief

curprev 12:1812:18, 4 September 2010‎ rosettacode>Dgamey‎ 28,069 bytes +1,311‎ +Icon+Unicon

23 August 2011

22 August 2011

8 August 2011

19 July 2011

13 July 2011

1 June 2011

25 May 2011

24 May 2011

11 May 2011

9 May 2011

8 May 2011

2 May 2011

18 March 2011

16 March 2011

4 March 2011

2 March 2011

16 February 2011

14 February 2011

10 February 2011

1 February 2011

15 January 2011

28 November 2010

27 November 2010

22 November 2010

20 November 2010

3 November 2010

28 October 2010

17 October 2010

13 September 2010

11 September 2010

4 September 2010