Sorting algorithms/Insertion sort: Difference between revisions
m
→{{header|Binary Lambda Calculus}}
| (35 intermediate revisions by 20 users not shown) | |||
Line 34:
{{trans|Python}}
<
L(i) 1 .< l.len
V j = i - 1
Line 45:
V arr = [7, 6, 5, 9, 8, 4, 3, 1, 2, 0]
insertion_sort(&arr)
print(arr)</
{{out}}
Line 56:
These programs use two ASSIST macros (XDECO, XPRNT) to keep the code as short as possible.
===Basic===
<
INSSORT CSECT
USING INSSORT,R13 base register
Line 112:
XDEC DS CL12 for xdeco
YREGS symbolics for registers
END INSSORT</
{{out}}
<pre>
Line 120:
===Assembler Structured Macros===
No harmful gotos [:)Dijkstra], no labels. It's cleaner, but is it clearer?
<
INSSORTS CSECT
USING INSSORTS,R13 base register
Line 172:
XDEC DS CL12 for xdeco
YREGS symbolics for registers
END INSSORTS</
{{out}}
Same as previous
=={{header|AArch64 Assembly}}==
<syntaxhighlight lang="asm">
.section .text
.globl insertion_sort
// C equivalent at bottom
/* void insertion_sort(int *arr, size_t len);
* X0: pointer to &a[0]
* X1: index of one past the last element of arr
* Preconditions:
* - Arg 1 (X0) is not a null pointer
* - Arg 2 (X1) is not zero
*/
#define ARR_BEGIN x0
#define ARR_END x2
#define I x3
#define J x4
#define OUTER_TMP w6
#define INNER_TMP w5
insertion_sort:
add ARR_END, ARR_BEGIN, x1, LSL #2
add I, ARR_BEGIN, #4
b 2f
// goto test;
// do {
0:
ldr OUTER_TMP, [I] // OUTER_TMP = *I;
// int INNER_TMP, *J;
// for (J = I; J != &arr[0] && (INNER_TMP = J[-1]) > OUTER_TMP; J--)
// *J = INNER_TMP;
mov J, I
b 3f
1:
// Loop body
str INNER_TMP, [J], #-4
3:
// Loop test
cmp J, ARR_BEGIN
b.eq 1f
ldr INNER_TMP, [J, #-4]
cmp INNER_TMP, OUTER_TMP
b.gt 1b
1:
str OUTER_TMP, [J] // *J = OUTER_TMP
add I, I, #4
// test:; } while (I < &arr[len]);
2:
cmp I, ARR_END
b.lo 0b
ret
/*
// First I wrote this C code, then I hand-compiled it to the above assembly.
void insertion_sort(int arr[], size_t len) {
int x, *pi, *pj;
for (pi = &a[1]; pi != &arr[len]; pi++) {
x = *pi;
for (pj = pi; pj != &a[0] && pj[-1] > x; pj--)
*pj = pj[-1];
*pj = x;
}
}
*/
</syntaxhighlight>{{works with|as|Raspberry Pi 3B version Buster 64 bits}}
<syntaxhighlight lang="aarch64 assembly">
/* ARM assembly AARCH64 Raspberry PI 3B */
/* program insertionSort64.s */
Line 340 ⟶ 404:
/* for this file see task include a file in language AArch64 assembly */
.include "../includeARM64.inc"
</syntaxhighlight>
=={{header|ACL2}}==
<
(cond ((endp xs) (list x))
((< x (first xs))
Line 353 ⟶ 417:
nil
(insert (first xs)
(isort (rest xs)))))</
=={{header|Action!}}==
<
INT i
Line 407 ⟶ 471:
Test(c,8)
Test(d,12)
RETURN</
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Insertion_sort.png Screenshot from Atari 8-bit computer]
Line 433 ⟶ 497:
=={{header|ActionScript}}==
<
{
for(var i:int = 1; i < array.length;i++)
Line 447 ⟶ 511:
}
return array;
}</
=={{header|Ada}}==
<
procedure Insertion_Sort(Item : in out Data_Array) is
Line 467 ⟶ 531:
Item(J + 1) := Value;
end loop;
end Insertion_Sort;</
=={{header|ALGOL 68}}==
Line 477 ⟶ 541:
{{works with|ELLA ALGOL 68|Any (with appropriate job cards) - tested with release [http://sourceforge.net/projects/algol68/files/algol68toc/algol68toc-1.8.8d/algol68toc-1.8-8d.fc9.i386.rpm/download 1.8-8d]}}
<
PROC in place insertion sort = (REF[]DATA item)VOID:
Line 501 ⟶ 565:
in place insertion sort(ref data);
FOR i TO UPB ref data DO print(ref data[i]) OD; print(new line);
print((data))</
{{out}}
<pre>
Line 510 ⟶ 574:
=={{header|ALGOL W}}==
External in-place insertion sort routine for integers. From the pseudo code but with variable bounds.
<
% of an array parameter, the lower and upper bounds must be specified in lb and ub %
procedure insertionSortI ( integer array A ( * ); integer value lb, ub ) ;
Line 522 ⟶ 586:
end while_j_ge_0_and_Aj_gt_v ;
A( j + 1 ) := v
end insertionSortI ;</
Test the insertionSortI procedure.
<
% external in-place insertion sort procedure %
procedure insertionSortI ( integer array A( * ); integer value lb, ub ) ;
Line 539 ⟶ 603:
write( i_w := 1, d( 1 ) );
for i := 2 until 8 do writeon( i_w := 1, d( i ) )
end.</
{{out}}
<pre>
Line 547 ⟶ 611:
=={{header|AppleScript}}==
<
on insertionSort(theList, l, r) -- Sort items l thru r of theList.
set listLength to (count theList)
Line 599 ⟶ 663:
set aList to {60, 73, 11, 66, 6, 77, 41, 97, 59, 45, 64, 15, 91, 100, 22, 89, 77, 59, 54, 61}
sort(aList, 1, -1) -- Sort items 1 thru -1 of aList.
return aList</
{{output}}
<
=={{header|ARM Assembly}}==
{{works with|as|Raspberry Pi}}
<syntaxhighlight lang="arm assembly">
/* ARM assembly Raspberry PI */
/* program insertionSort.s */
Line 830 ⟶ 894:
bx lr @ leave function
iMagicNumber: .int 0xCCCCCCCD
</syntaxhighlight>
=={{header|Arturo}}==
<
arr: new items
loop 1..(size items)-1 'i [
Line 851 ⟶ 915:
]
print insertionSort [3 1 2 8 5 7 9 4 6]</
{{out}}
Line 863 ⟶ 927:
This implementation finds the position at which the element is to be inserted, and then uses '''array_subcirculate''' to move it into place. The prelude's implementation of '''array_subcirculate''' is a '''memmove(3)'''.
<
(*------------------------------------------------------------------*)
Line 948 ⟶ 1,012:
print! (" ", arr[i]);
println! ()
end</
{{out}}
Sorting random numbers.
<pre>$ patscc -DATS_MEMALLOC_GCBDW -O3 insertion_sort_task_array_of_nonlinear.dats -lgc && ./a.out
3 6 7 5 3 5 6 2 9 1 2 7 0 9 3 6 0 6 2 6 1 8 7 9 2 0 2 3 7 5
0 0 0 1 1 2 2 2 2 2 3 3 3 3 5 5 5 6 6 6 6 6 7 7 7 7 8 9 9 9</pre>
===For arrays whose elements may be of linear type===
Line 956 ⟶ 1,026:
(The complications are necessary to prevent us accidentally having two copies of a linear value. Having two copies would introduce such nasty possibilities as a double-free error, use of a destroyed list, etc.)
<
(*------------------------------------------------------------------*)
Line 1,117 ⟶ 1,187:
array_uninitize<Strptr1> (arr, i2sz SIZE);
array_ptr_free (pf_arr, pfgc_arr | p_arr)
end</
{{out}}
Sorting random numbers by their first digit, to demonstrate that the sort is stable. The numbers are stored in the array as linear strings (strings that must be explicitly freed), to demonstrate that the sort works with linear types.
<pre>$ patscc -DATS_MEMALLOC_LIBC -O3 insertion_sort_task_array_of_linear.dats && ./a.out
83 86 77 15 93 35 86 92 49 21 62 27 90 59 63 26 40 26 72 36 11 68 67 29 82 30 62 23 67 35
15 11 21 27 26 26 29 23 35 36 30 35 49 40 59 62 63 68 67 62 67 77 72 83 86 86 82 93 92 90</pre>
===For linear lists whose elements may be of linear type===
It is useful in a language such as ATS to have a stable insertion sort that operates on singly-linked lists. Such a sort can serve as the innermost part of a list mergesort or list quicksort.
None of the activities in the following implementation requires allocating a new node. The original list is consumed. However, you can use this code to non-destructively sort a non-linear list by first creating a copy, casting the copy to a linear list, and sorting the copy, then casting the result to a non-linear list.
<syntaxhighlight lang="ats">#include "share/atspre_staload.hats"
(*------------------------------------------------------------------*)
(* Interface *)
extern fn {a : vt@ype} (* The "less than" template. *)
insertion_sort$lt : (&a, &a) -<> bool (* Arguments by reference. *)
extern fn {a : vt@ype}
insertion_sort
{n : int}
(lst : list_vt (a, n))
:<!wrt> list_vt (a, n)
(*------------------------------------------------------------------*)
(* Implementation *)
(* This implementation is based on the insertion-sort part of the
mergesort code of the ATS prelude.
Unlike the prelude, however, I build the sorted list in reverse
order. Building the list in reverse order actually makes the
implementation more like that for an array. *)
(* Some convenient shorthands. *)
#define NIL list_vt_nil ()
#define :: list_vt_cons
(* Inserting in reverse order minimizes the work for a list already
nearly sorted, or for stably sorting a list whose entries often
have equal keys. *)
fun {a : vt@ype}
insert_reverse
{m : nat}
{p_xnode : addr}
{p_x : addr}
{p_xs : addr}
.<m>.
(pf_x : a @ p_x,
pf_xs : list_vt (a, 0)? @ p_xs |
dst : &list_vt (a, m) >> list_vt (a, m + 1),
(* list_vt_cons_unfold is a viewtype created by the
unfolding of a list_vt_cons (our :: operator). *)
xnode : list_vt_cons_unfold (p_xnode, p_x, p_xs),
p_x : ptr p_x,
p_xs : ptr p_xs)
:<!wrt> void =
(* dst is some tail of the current (reverse-order) destination list.
xnode is a viewtype for the current node in the source list.
p_x points to the node's CAR.
p_xs points to the node's CDR. *)
case+ dst of
| @ (y :: ys) =>
if insertion_sort$lt<a> (!p_x, y) then
let (* Move to the next destination node. *)
val () = insert_reverse (pf_x, pf_xs | ys, xnode, p_x, p_xs)
prval () = fold@ dst
in
end
else
let (* Insert xnode here. *)
prval () = fold@ dst
val () = !p_xs := dst
val () = dst := xnode
prval () = fold@ dst
in
end
| ~ NIL =>
let (* Put xnode at the end. *)
val () = dst := xnode
val () = !p_xs := NIL
prval () = fold@ dst
in
end
implement {a}
insertion_sort {n} lst =
let
fun (* Create a list sorted in reverse. *)
loop {i : nat | i <= n}
.<n - i>.
(dst : &list_vt (a, i) >> list_vt (a, n),
src : list_vt (a, n - i))
:<!wrt> void =
case+ src of
| @ (x :: xs) =>
let
val tail = xs
in
insert_reverse<a> (view@ x, view@ xs |
dst, src, addr@ x, addr@ xs);
loop (dst, tail)
end
| ~ NIL => () (* We are done. *)
prval () = lemma_list_vt_param lst
var dst : List_vt a = NIL
in
loop (dst, lst);
(* Reversing a linear list is an in-place operation. *)
list_vt_reverse<a> dst
end
(*------------------------------------------------------------------*)
(* The demonstration converts random numbers to linear strings, then
sorts the elements by their first character. Thus here is a simple
demonstration that the sort can handle elements of linear type, and
also that the sort is stable. *)
implement
main0 () =
let
implement
insertion_sort$lt<Strptr1> (x, y) =
let
val sx = $UNSAFE.castvwtp1{string} x
and sy = $UNSAFE.castvwtp1{string} y
val cx = $effmask_all $UNSAFE.string_get_at (sx, 0)
and cy = $effmask_all $UNSAFE.string_get_at (sy, 0)
in
cx < cy
end
implement
list_vt_freelin$clear<Strptr1> x =
strptr_free x
#define SIZE 30
fn
create_the_list ()
:<!wrt> list_vt (Strptr1, SIZE) =
let
fun
loop {i : nat | i <= SIZE}
.<SIZE - i>.
(lst : list_vt (Strptr1, i),
i : size_t i)
:<!wrt> list_vt (Strptr1, SIZE) =
if i = i2sz SIZE then
list_vt_reverse lst
else
let
#define BUFSIZE 10
var buffer : array (char, BUFSIZE)
val () =
array_initize_elt<char> (buffer, i2sz BUFSIZE, '\0')
val _ = $extfcall (int, "snprintf", addr@ buffer,
i2sz BUFSIZE, "%d",
$extfcall (int, "rand") % 100)
val () = buffer[BUFSIZE - 1] := '\0'
val s = string0_copy ($UNSAFE.cast{string} buffer)
in
loop (s :: lst, succ i)
end
in
loop (NIL, i2sz 0)
end
var p : List string
val lst = create_the_list ()
val () =
for (p := $UNSAFE.castvwtp1{List string} lst;
isneqz p;
p := list_tail p)
print! (" ", list_head p)
val () = println! ()
val lst = insertion_sort<Strptr1> lst
val () =
for (p := $UNSAFE.castvwtp1{List string} lst;
isneqz p;
p := list_tail p)
print! (" ", list_head p)
val () = println! ()
val () = list_vt_freelin lst
in
end</syntaxhighlight>
{{out}}
Sorting random numbers by their first digit, to demonstrate that the sort is stable. The numbers are stored in the list as linear strings (strings that must be explicitly freed), to demonstrate that the sort works if the list elements themselves are linear.
<pre>$ patscc -DATS_MEMALLOC_LIBC -O3 insertion_sort_task_linear_list.dats && ./a.out
83 86 77 15 93 35 86 92 49 21 62 27 90 59 63 26 40 26 72 36 11 68 67 29 82 30 62 23 67 35
15 11 21 27 26 26 29 23 35 36 30 35 49 40 59 62 63 68 67 62 67 77 72 83 86 86 82 93 92 90</pre>
Line 1,127 ⟶ 1,396:
=={{header|AutoHotkey}}==
contributed by Laszlo on the ahk [http://www.autohotkey.com/forum/post-276481.html#276481 forum]
<
MsgBox % InsertionSort("xxx")
MsgBox % InsertionSort("3,2,1")
Line 1,143 ⟶ 1,412:
sorted .= "," . a%A_Index%
Return SubStr(sorted,2) ; drop leading comma
}</
=={{header|AWK}}==
Sort standard input (storing lines into an array) and output to standard output
<
line[NR] = $0
}
Line 1,164 ⟶ 1,433:
print line[i]
}
}</
=={{header|Bash}}==
<
# Sorting integers with insertion sort
Line 1,247 ⟶ 1,516:
fi
#END</
{{out}}
Line 1,260 ⟶ 1,529:
=={{header|B4X}}==
The array type can be changed to Object and it will then work with any numeric type.
<
For i = 1 To A.Length - 1
Dim value As Int = A(i)
Line 1,279 ⟶ 1,548:
Next
End Sub
</syntaxhighlight>
{{out}}
<pre>
Line 1,295 ⟶ 1,564:
This version should work on any BASIC that can accept arrays as function arguments.
<
DIM n(10) AS INTEGER, L AS INTEGER, o AS STRING
Line 1,324 ⟶ 1,593:
theList(j + 1) = insertionElement
NEXT
END SUB</
{{out}}
Line 1,330 ⟶ 1,599:
1486 ; 9488 ; 9894 ; 17479 ; 18989 ; 23119 ; 23233 ; 24927 ; 25386 ; 26689 ;
</pre>
==={{header|GW-BASIC}}===
{{works with|BASICA}}
{{works with|QBasic}}
{{works with|QuickBASIC}}
{{works with|VB-DOS}}
Sorts N integers in an array a() with the Insertion sort
<syntaxhighlight lang="qbasic">
10 'SAVE "INSERTGW",A
20 DEFINT A-Z
30 OPTION BASE 1
40 N=20: R=100: I=0: Y=0: V=0: P=0
50 DIM A(N)
60 ' Creates the disordered array
70 CLS: PRINT "This program sorts by Insertion a list of randomly generated numbers."
80 PRINT: PRINT "Unsorted list:"
90 RANDOMIZE TIMER
100 FOR I = 1 TO N
110 A(I) = INT(RND * R) + 1
120 NEXT I
130 GOSUB 260
140 PRINT: PRINT "Sorted list."
150 ' Insertion Sort
160 FOR I=1 TO N
170 V=A(I): P=I-1: S=1
180 WHILE P>0 AND S=1
185 S=0
190 IF A(P) > V THEN A(P+1)=A(P): P=P-1: S=1
200 WEND
210 A(P+1) = V
220 NEXT I
230 GOSUB 260
240 PRINT: PRINT "End of program execution."
250 END
260 ' Print list routine
270 FOR I=1 TO N
280 PRINT A(I);
290 NEXT I
300 PRINT
310 RETURN
</syntaxhighlight>
{{out}}
<pre>This program sorts by Insertion a list of randomly generated numbers.
Unsorted list:
73 11 100 68 28 48 3 36 15 34 31 26 47 61 5 58 15 86 69 79
Sorted list:
3 5 11 15 15 26 28 31 34 36 47 48 58 61 68 69 73 79 86 100
End of program execution.</pre>
==={{header|ZX BASIC}}===
Line 1,335 ⟶ 1,657:
Sorts N elements in array i() into ascending order. Invoke with GO SUB 500.
<
510 IF i(j)<=i(j+1) THEN NEXT j: RETURN
520 LET c=i(j+1)
530 FOR k=j TO 1 STEP -1: IF i(k)>c THEN LET i(k+1)=i(k): NEXT k
540 LET i(k+1)=c
600 NEXT j: RETURN</
For those who prefer GO TOs over conditional NEXTs (fine in ZX BASIC but problematic for compilers and stack-dependent interpreters like NextBASIC’s integer extensions) replace NEXT J: RETURN in line 510 with GO TO 600 and use this line 530:
Line 1,349 ⟶ 1,671:
==={{header|BBC BASIC}}===
Note that the array index is assumed to start at zero.
<
test() = 4, 65, 2, -31, 0, 99, 2, 83, 782, 1
PROCinsertionsort(test(), 10)
Line 1,369 ⟶ 1,691:
a(j%) = t
NEXT
ENDPROC</
{{out}}
<pre>
Line 1,376 ⟶ 1,698:
==={{header|Commodore BASIC}}===
<
10 DIM A(10): N=9
11 REM GENERATE SOME RANDOM NUMBERS AND PRINT THEM
Line 1,385 ⟶ 1,707:
32 RETURN
50 PRINT: FOR I=0 TO N: PRINTA(I): NEXT: RETURN
</syntaxhighlight>
==={{header|IS-BASIC}}===
<syntaxhighlight lang
110 RANDOMIZE
120 NUMERIC ARRAY(5 TO 21)
Line 1,414 ⟶ 1,736:
340 LET A(I+1)=SW
350 NEXT
360 END DEF</
=={{header|BASIC256}}==
{{trans|FreeBASIC}}
<syntaxhighlight lang="basic">global array
dim array(15)
a = array[?,]
b = array[?]
for i = a to b-1
array[i] = int(rand * 100)
next i
print "unsort ";
for i = a to b-1
print rjust(array[i], 4);
next i
call insertionSort(array) # ordenar el array
print chr(10); " sort ";
for i = a to b-1
print rjust(array[i], 4);
next i
end
subroutine insertionSort(array)
lb = array[?,]
for i = lb + 1 to array[?]-1
valor = array[i]
j = i - 1
while j >= lb and array[j] > valor
array[j +1] = array[j]
j -= 1
end while
array[j+1] = valor
next i
end subroutine</syntaxhighlight>
=={{header|BCPL}}==
<
let insertionSort(A, len) be
Line 1,442 ⟶ 1,802:
insertionSort(array, length)
write("After: ", array, length)
$)</
{{out}}
<pre>Before: 4 65 2 -31 0 99 2 83 782 1
After: -31 0 1 2 2 4 65 83 99 782</pre>
=={{header|Binary Lambda Calculus}}==
As documented at https://github.com/tromp/AIT/blob/master/lists/sort.lam, the 55 byte BLC program
<pre>15 46 84 06 05 46 81 60 15 fb ec 2f 80 01 5b f9 7f 0b 7e f7 2f ec 2d fb 80 56 05 fd 85 bb 76 11 5d 50 5c 00 8b f3 ff 04 af fe 60 de 57 ff 30 5d 81 ff c2 dd 9a 28 20</pre>
sorts a list of bitstrings, such as integers of a fixed bit-width, lexicographically.
=={{header|C}}==
<
void insertion_sort(int*, const size_t);
Line 1,480 ⟶ 1,848:
return 0;
}
</syntaxhighlight>
{{out}}
<pre>
Line 1,488 ⟶ 1,856:
=={{header|C sharp|C#}}==
<
using System;
Line 1,508 ⟶ 1,876:
}
}
}</
'''Example''':
<
using System;
Line 1,519 ⟶ 1,887:
Console.WriteLine(String.Join(" ", entries));
}
}</
=={{header|C++}}==
Line 1,525 ⟶ 1,893:
g++ -std=c++11 insertion.cpp
Uses binary search via std::upper_bound() to find the insertion position in logarithmic time and then performs the insertion via std::rotate() in linear time.
<
#include <iostream>
#include <iterator>
Line 1,557 ⟶ 1,925:
std::cout << "\n";
}</
{{out}}
<pre>
Line 1,564 ⟶ 1,932:
=={{header|Clojure}}==
<
(defn insertion-sort [coll]
(reduce (fn [result input]
Line 1,571 ⟶ 1,939:
[]
coll))
</syntaxhighlight>
Translated from the Haskell example:
<
(defn in-sort! [data]
(letfn [(insert ([raw x](insert [] raw x))
Line 1,583 ⟶ 1,951:
(reduce insert [] data)))
;Usage:(in-sort! [6,8,5,9,3,2,1,4,7])
;Returns: [1 2 3 4 5 6 7 8 9]</
=={{header|CLU}}==
<
insertion_sort = proc [T: type] (a: array[T])
where T has lt: proctype (T,T) returns (bool)
Line 1,621 ⟶ 1,989:
insertion_sort[int](test)
stream$puts(po, "After: ") print_arr[int](test, 3, po)
end start_up</
{{out}}
<pre>Before: 7 -5 0 2 99 16 4 20 47 19
Line 1,627 ⟶ 1,995:
=={{header|CMake}}==
<
function(insertion_sort var)
math(EXPR last "${ARGC} - 1") # Sort ARGV[1..last].
Line 1,657 ⟶ 2,025:
endforeach(i)
set("${var}" "${answer}" PARENT_SCOPE)
endfunction(insertion_sort)</
<
message(STATUS "${result}") # -- 11;22;33;44;55;66</
=={{header|COBOL}}==
This exerpt contains just enough of the procedure division to show the sort itself. The appropriate data division entries can be inferred. See also the entry for the Bubble sort for a full program.
<
PERFORM E-INSERTION VARYING WB-IX-1 FROM 1 BY 1
UNTIL WB-IX-1 > WC-SIZE.
Line 1,690 ⟶ 2,058:
F-999.
EXIT.</
And a fully runnable version, by Steve Williams
{{works with|GnuCOBOL}}
<syntaxhighlight lang="cobol">
>>SOURCE FORMAT FREE
*> This code is dedicated to the public domain
Line 1,764 ⟶ 2,132:
stop run
.
end program insertionsort.</
{{out}}
Line 1,773 ⟶ 2,141:
=={{header|Common Lisp}}==
<
(let ((tail (member-if-not predicate list)))
(values (ldiff list tail) tail)))
Line 1,785 ⟶ 2,153:
(defun insertion-sort (list)
(reduce #'insert list :initial-value nil))</
<
(if (cdr sequence)
(insert (car sequence) ;; insert the current item into
Line 1,804 ⟶ 2,172:
(insert item ;; the list of the item sorted with the rest of the list
(cdr sequence)
predicate)))))</
=={{header|Craft Basic}}==
<syntaxhighlight lang="basic">define size = 10, value = 0
dim list[size]
gosub fill
gosub sort
gosub show
end
sub fill
for i = 0 to size - 1
let list[i] = int(rnd * 100)
next i
return
sub sort
for i = 1 to size - 1
let value = list[i]
let j = i - 1
do
if j >= 0 and list[j] > value then
let p = j + 1
let list[p] = list[j]
let j = j - 1
endif
loop j >= 0 and list[j] > value
let p = j + 1
let list[p] = value
wait
next i
return
sub show
for i = 0 to size - 1
print i, ": ", list[i]
next i
return</syntaxhighlight>
=={{header|D}}==
<
foreach (immutable i, value; data[1 .. $]) {
auto j = i + 1;
Line 1,821 ⟶ 2,248:
items.insertionSort;
items.writeln;
}</
{{out}}
<pre>[2, 4, 11, 17, 19, 24, 25, 28, 44, 46]</pre>
Line 1,827 ⟶ 2,254:
===Higher Level Version===
{{trans|C++}}
<
void insertionSort(R)(R arr)
Line 1,857 ⟶ 2,284:
assert(arr3.isSorted);
}
}</
{{out}}
<pre>arr1 sorted: [2, 4, 11, 17, 19, 24, 25, 28, 44, 46]
Line 1,866 ⟶ 2,293:
{{trans|Java}}
<
insertSort(List<int> array){
Line 1,885 ⟶ 2,312:
print('${a}');
}
</syntaxhighlight>
{{out}}
<pre>array unsorted: [10, 3, 11, 15, 19, 1];
Line 1,896 ⟶ 2,323:
Static array is an arbitrary-based array of fixed length
<
{$APPTYPE CONSOLE}
Line 1,945 ⟶ 2,372:
Writeln;
Readln;
end.</
{{out}}
<pre>
Line 1,954 ⟶ 2,381:
===String sort===
// string is 1-based variable-length array of Char
<
var
I, J, L: Integer;
Line 1,970 ⟶ 2,397:
S[J + 1]:= Ch;
end;
end;</
<pre>
// in : S = 'the quick brown fox jumps over the lazy dog'
Line 1,980 ⟶ 2,407:
A direct conversion of the pseudocode.
<
for i in 1..!(array.size()) {
def value := array[i]
Line 1,990 ⟶ 2,417:
array[j+1] := value
}
}</
Test case:
<
> insertionSort(a)
> a
# value: [10, 10, 10, 13, 14, 17, 22, 23, 24, 26, 27, 27, 39, 40, 47, 50, 52, 53, 54, 55, 59, 60, 61, 62, 63, 65, 67, 71, 75, 75, 78, 83, 85, 85, 88, 91, 93, 94, 96, 99].diverge()</
=={{header|EasyLang}}==
<syntaxhighlight lang="text">
proc sort . d[] .
for
d[j
d[j + 1] = h
.
.
data[] = [ 29 4 72 44 55 26 27 77 92 5 ]
print data[]
</syntaxhighlight>
=={{header|Eiffel}}==
Line 2,023 ⟶ 2,452:
For a more complete explanation of the Eiffel sort examples, see the [[Sorting algorithms/Bubble sort#Eiffel|Bubble sort]].
<
MY_SORTED_SET [G -> COMPARABLE]
inherit
Line 2,054 ⟶ 2,483:
end
end</
=={{header|Elena}}==
ELENA
<
extension op
Line 2,067 ⟶ 2,496:
insertionSort(int first, int last)
{
for(int i := first + 1
{
var entry := self[i];
Line 2,090 ⟶ 2,519:
console.printLine("before:", list.asEnumerable());
console.printLine("after :", list.insertionSort().asEnumerable());
}</
{{out}}
<pre>
Line 2,098 ⟶ 2,527:
=={{header|Elixir}}==
<
def insert_sort(list) when is_list(list), do: insert_sort(list, [])
Line 2,107 ⟶ 2,536:
defp insert(x, sorted) when x < hd(sorted), do: [x | sorted]
defp insert(x, [h | t]), do: [h | insert(x, t)]
end</
Example:
Line 2,116 ⟶ 2,545:
=={{header|Emacs Lisp}}==
<
"Return minimum or maximum of NUMBERS using COMPARATOR."
(let ((extremum (car numbers)))
Line 2,145 ⟶ 2,574:
nil))
(insertion-sort '(1 2 3 9 8 7 25 12 3 2 1) #'>)</
{{out}}
(25 12 9 8 7 3 3 2 2 1 1)
=={{header|EMal}}==
<syntaxhighlight lang="emal">
fun insertionSort = void by List a # sort list in place
for int i = 1; i < a.length; ++i
var v = a[i]
int j
for j = i - 1; j >= 0 and a[j] > v; --j
a[j + 1] = a[j]
end
a[j + 1] = v
end
end
List lists = List[ # a list of lists
int[4, 65, 2, -31, 0, 99, 83, 782, 1],
real[5.17, 2, 5.12],
text["this", "is", "insertion", "sort"]]
for each List list in lists
writeLine("Before: " + text!list) # list as text
insertionSort(list)
writeLine("After : " + text!list)
writeLine()
end
</syntaxhighlight>
{{out}}
<pre>
Before: [4,65,2,-31,0,99,83,782,1]
After : [-31,0,1,2,4,65,83,99,782]
Before: [5.17,2.0,5.12]
After : [2.0,5.12,5.17]
Before: [this,is,insertion,sort]
After : [insertion,is,sort,this]
</pre>
=={{header|Erlang}}==
<
-export([insertion/1]).
Line 2,159 ⟶ 2,623:
insert(X,[]) -> [X];
insert(X,L=[H|_]) when X =< H -> [X|L];
insert(X,[H|T]) -> [H|insert(X, T)].</
And the calls:
<
{ok,sort}
2> sort:insertion([5,3,9,4,1,6,8,2,7]).
[1,2,3,4,5,6,7,8,9]</
=={{header|ERRE}}==
Note: array index is assumed to start at zero.
<syntaxhighlight lang="erre">
PROGRAM INSERTION_SORT
Line 2,203 ⟶ 2,667:
PRINT
END PROGRAM
</syntaxhighlight>
{{out}}
<pre>
Line 2,211 ⟶ 2,675:
=={{header|Euphoria}}==
<
object temp
integer j
Line 2,232 ⟶ 2,696:
pretty_print(1,s,{2})
puts(1,"\nAfter: ")
pretty_print(1,insertion_sort(s),{2})</
{{out}}
Line 2,270 ⟶ 2,734:
=={{header|F Sharp|F#}}==
Procedural Version
<
// This function performs an insertion sort with an array.
// The input parameter is a generic array (any type that can perform comparison).
Line 2,285 ⟶ 2,749:
B.[j+1] <- value
B // the array B is returned
</syntaxhighlight>
Functional Version
<
let insertionSort collection =
Line 2,304 ⟶ 2,768:
| x::xs, ys -> xs |> isort (sinsert x ys)
collection |> isort []
</syntaxhighlight>
=={{header|Factor}}==
{{trans|Haskell}}
<
: insertion-sort ( seq -- sorted-seq )
<reversed> V{ } clone [ swap insort-left! ] reduce ;
{ 6 8 5 9 3 2 1 4 7 } insertion-sort .</
{{out}}
<pre>
Line 2,322 ⟶ 2,786:
=={{header|Forth}}==
<
dup @ >r ( r: v ) \ v = a[i]
begin
Line 2,339 ⟶ 2,803:
create test 7 , 3 , 0 , 2 , 9 , 1 , 6 , 8 , 4 , 5 ,
test 10 sort
test 10 cells dump</
=={{header|Fortran}}==
{{works with|Fortran|90 and later}}
<
implicit none
integer :: n, i, j
Line 2,359 ⟶ 2,823:
a(j + 1) = x
end do
end subroutine</
=== Alternate Fortran 77 version ===
<
IMPLICIT NONE
INTEGER N,I,J
Line 2,376 ⟶ 2,840:
20 A(J + 1) = X
30 CONTINUE
END</
=={{header|FreeBASIC}}==
<
' compile with: fbc -s console
' for boundry checks on array's compile with: fbc -s console -exx
Line 2,428 ⟶ 2,892:
Print : Print "hit any key to end program"
Sleep
End</
{{out}}
<pre>unsort -7 -1 4 -6 5 2 1 -2 0 -5 -4 6 -3 7 3
Line 2,434 ⟶ 2,898:
=={{header|GAP}}==
<
local n, i, j, x;
n := Length(L);
Line 2,451 ⟶ 2,915:
InsertionSort(s);
s;
# "ABCDEFGHIJKLMNOPQRSTUVWXYZ"</
=={{header|Go}}==
<
import "fmt"
Line 2,476 ⟶ 2,940:
insertionSort(list)
fmt.Println("sorted! ", list)
}</
{{out}}
<pre>
Line 2,484 ⟶ 2,948:
A generic version that takes any container that conforms to <code>sort.Interface</code>:
<
import (
Line 2,505 ⟶ 2,969:
insertionSort(sort.IntSlice(list))
fmt.Println("sorted! ", list)
}</
{{out}}
<pre>
Line 2,513 ⟶ 2,977:
Using binary search to locate the place to insert:
<
import (
Line 2,535 ⟶ 2,999:
insertionSort(list)
fmt.Println("sorted! ", list)
}</
{{out}}
<pre>
Line 2,544 ⟶ 3,008:
=={{header|Groovy}}==
Solution:
<
def size = list.size()
Line 2,556 ⟶ 3,020:
}
list
}</
Test:
<
println (insertionSort([88,18,31,44,4,0,8,81,14,78,20,76,84,33,73,75,82,5,62,70,12,7,1]))</
{{out}}
Line 2,567 ⟶ 3,031:
=={{header|Haskell}}==
<
insertionSort :: Ord a => [a] -> [a]
Line 2,574 ⟶ 3,038:
-- Example use:
-- *Main> insertionSort [6,8,5,9,3,2,1,4,7]
-- [1,2,3,4,5,6,7,8,9]</
=={{header|Haxe}}==
<
@:generic
public static function sort<T>(arr:Array<T>) {
Line 2,609 ⟶ 3,073:
Sys.println('Sorted Strings: ' + stringArray);
}
}</
{{out}}
Line 2,622 ⟶ 3,086:
=={{header|HicEst}}==
<
value = A(i)
j = i - 1
Line 2,633 ⟶ 3,097:
ENDIF
A(j+1) = value
ENDDO</
=={{header|Icon}} and {{header|Unicon}}==
<
demosort(insertionsort,[3, 14, 1, 5, 9, 2, 6, 3],"qwerty")
end
Line 2,652 ⟶ 3,116:
}
return X
end</
Note: This example relies on [[Sorting_algorithms/Bubble_sort#Icon| the supporting procedures 'sortop', and 'demosort' in Bubble Sort]]. The full demosort exercises the named sort of a list with op = "numeric", "string", ">>" (lexically gt, descending),">" (numerically gt, descending), a custom comparator, and also a string.
Line 2,666 ⟶ 3,130:
=={{header|Io}}==
<syntaxhighlight lang="io">
List do(
insertionSortInPlace := method(
Line 2,683 ⟶ 3,147:
lst := list(7, 6, 5, 9, 8, 4, 3, 1, 2, 0)
lst insertionSortInPlace println # ==> list(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)</
A shorter, but slightly less efficient, version:
<
insertionSortInPlace := method(
# In fact, we could've done slice(1, size - 1) foreach(...)
Line 2,699 ⟶ 3,163:
lst := list(7, 6, 5, 9, 8, 4, 3, 1, 2, 0)
lst insertionSortInPlace println # ==> list(0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
</syntaxhighlight>
=={{header|Isabelle}}==
<
imports Main
begin
Line 2,759 ⟶ 3,223:
unfolding rosettacode_haskell_insertionsort_def by(induction xs) simp+
end</
Line 2,765 ⟶ 3,229:
{{eff note|J|/:~}}
Solution inspired by the Common LISP solution:
<
Example of use:
<
_38 1 2 3 4 32 34 95 120</
=={{header|Java}}==
<
for(int i = 1; i < A.length; i++){
int value = A[i];
Line 2,781 ⟶ 3,245:
A[j + 1] = value;
}
}</
Using some built-in algorithms (warning: not stable, due to the lack of an "upper bound" binary search function)
{{trans|C++}}
<
for (int i = 1; i < a.size(); i++) {
int j = Math.abs(Collections.binarySearch(a.subList(0, i), a.get(i)) + 1);
Line 2,798 ⟶ 3,262:
a[j] = x;
}
}</
=={{header|JavaScript}}==
<
function insertionSort (a) {
for (var i = 0; i < a.length; i++) {
Line 2,814 ⟶ 3,278:
var a = [4, 65, 2, -31, 0, 99, 83, 782, 1];
insertionSort(a);
document.write(a.join(" "));</
=={{header|jq}}==
{{works with|jq|1.4}}
The insertion sort can be expressed directly in jq as follows:
<
reduce .[] as $x ([]; insert($x));</
The following solution uses an "industrial strength" implementation of bsearch (binary search) that requires the following control structure:
<
def do_until(condition; next):
def u: if condition then . else (next|u) end;
u;</
bsearch is the only non-trivial part of this solution, and so we include
Line 2,835 ⟶ 3,299:
(-1 - ix), where ix is the insertion point that would leave the array sorted.
If the input is not sorted, bsearch will terminate but with irrelevant results.<
if length == 0 then -1
elif length == 1 then
Line 2,872 ⟶ 3,336:
def insertion_sort:
reduce .[] as $x ([]; insert($x));</
Example:<
{{Out}}
[null,-1.1,1,1,1.1,2,[null],{"null":null}]
=={{header|Julia}}==
<
function insertionsort!(A::Array{T}) where T <: Number
Line 2,894 ⟶ 3,358:
x = randn(5)
@show x insertionsort!(x)</
{{out}}
Line 2,901 ⟶ 3,365:
=={{header|Kotlin}}==
<
for (index in 1 until array.size) {
val value = array[index]
Line 2,927 ⟶ 3,391:
insertionSort(numbers)
printArray("Sorted:", numbers)
}</
{{out}}
Line 2,934 ⟶ 3,398:
=={{header|Ksh}}==
<
# An insertion sort in ksh
Line 2,972 ⟶ 3,436:
printf "%d " ${arr[i]}
done
printf "%s\n" " )"</
{{out}}
Line 2,978 ⟶ 3,442:
=={{header|Lambdatalk}}==
<
{def sort
Line 3,004 ⟶ 3,468:
{sort {A}}
-> [-31,0,1,2,4,65,83,99,782]
</syntaxhighlight>
=={{header|Liberty BASIC}}==
<
dim A(itemCount)
for i = 1 to itemCount
Line 3,037 ⟶ 3,501:
next i
print
return</
=={{header|Lua}}==
Binary variation of Insertion sort (Has better complexity)
<
local function lower_bound(container, container_begin, container_end, value, comparator)
local count = container_end - container_begin + 1
Line 3,086 ⟶ 3,550:
binary_insertion_sort_impl(container, comparator)
end
end</
<
local st, en = st or 1, en or #tb
local mid = math.floor((st + en)/2)
Line 3,103 ⟶ 3,567:
end
print(unpack(isort{4,5,2,7,8,3}))</
=={{header|Maple}}==
<
len := numelems(arr):
for i from 2 to len do
Line 3,117 ⟶ 3,581:
arr[j+1] := val:
end do:
arr;</
{{Out|Output}}
<pre>[0,0,2,3,3,8,17,36,40,72]</pre>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
<
For[i = 2, i <= Length[A], i++,
value = A[[i]]; j = i - 1;
Line 3,128 ⟶ 3,592:
A[[j + 1]] = value;];
A
]</
{{out}}
<pre>insertionSort@{ 2, 1, 3, 5}
Line 3,135 ⟶ 3,599:
=={{header|MATLAB}} / {{header|Octave}}==
This is a direct translation of the pseudo-code above, except that it has been modified to compensate for MATLAB's 1 based arrays.
<
for i = (2:numel(list))
Line 3,150 ⟶ 3,614:
end %for
end %insertionSort</
Sample Usage:
<
ans =
1 2 3 4 5 6</
=={{header|Maxima}}==
<
[n: length(u), x, j],
for i from 2 thru n do (
Line 3,171 ⟶ 3,635:
u[j + 1]: x
)
)$</
=={{header|MAXScript}}==
<syntaxhighlight lang="maxscript">
fn inSort arr =
(
Line 3,189 ⟶ 3,653:
return arr
)
</syntaxhighlight>
Output:
<syntaxhighlight lang="maxscript">
b = for i in 1 to 20 collect random 1 40
#(2, 28, 35, 31, 27, 24, 2, 22, 15, 34, 9, 10, 22, 40, 26, 5, 23, 6, 18, 33)
a = insort b
#(2, 2, 5, 6, 9, 10, 15, 18, 22, 22, 23, 24, 26, 27, 28, 31, 33, 34, 35, 40)
</syntaxhighlight>
=={{header|Miranda}}==
<syntaxhighlight lang="miranda">main :: [sys_message]
main = [Stdout ("Before: " ++ show testlist ++ "\n"),
Stdout ("After: " ++ show (insertionsort testlist) ++ "\n")]
where testlist = [4,65,2,-31,0,99,2,83,782,1]
insertionsort :: [*]->[*]
insertionsort = foldr insert []
insert :: *->[*]->[*]
insert x [] = [x]
insert x (y:ys) = x:y:ys, if x<y
= y:insert x ys, otherwise</syntaxhighlight>
{{out}}
<pre>Before: [4,65,2,-31,0,99,2,83,782,1]
After: [-31,0,1,2,2,4,65,83,99,782]</pre>
=={{header|ML}}==
==={{header|mLite}}===
{{trans|OCaml}}
<
let
fun insert
Line 3,215 ⟶ 3,697:
println ` insertion_sort [6,8,5,9,3,2,1,4,7];
</syntaxhighlight>
Output
<pre>
Line 3,222 ⟶ 3,704:
==={{header|Standard ML}}===
<
fun insert (x, []) = [x]
| insert (x, y::ys) =
Line 3,231 ⟶ 3,713:
end;
insertion_sort Int.compare [6,8,5,9,3,2,1,4,7];</
=={{header|Modula-3}}==
{{trans|Ada}}
<
PROCEDURE IntSort(VAR item: ARRAY OF INTEGER) =
Line 3,250 ⟶ 3,732:
END;
END IntSort;
END InsertSort.</
=={{header|N/t/roff}}==
Line 3,257 ⟶ 3,739:
===Sliding method===
<
..
.de array
Line 3,311 ⟶ 3,793:
.a.pushln 13 64 22 87 54 87 23 92 11 64 5 9 3 3 0
.insertionsort a
.a.dump</
===Swapping method===
<
..
.de array
Line 3,358 ⟶ 3,840:
.a.pushln 13 64 22 87 54 87 23 92 11 64 5 9 3 3 0
.insertionsort a
.a.dump</
=={{header|Nanoquery}}==
{{trans|Python}}
<
for i in range(1, len(L) - 1)
j = i - 1
Line 3,374 ⟶ 3,856:
return L
end</
=={{header|Nemerle}}==
From the psuedocode.
<
using Nemerle.English;
Line 3,404 ⟶ 3,886:
foreach (i in arr) Write($"$i ");
}
}</
=={{header|NetRexx}}==
<
options replace format comments java crossref savelog symbols binary
Line 3,454 ⟶ 3,936:
return ArrayList(A)
</syntaxhighlight>
{{out}}
<pre>
Line 3,477 ⟶ 3,959:
=={{header|Nim}}==
<
for i in 1 .. a.high:
let value = a[i]
Line 3,488 ⟶ 3,970:
var a = @[4, 65, 2, -31, 0, 99, 2, 83, 782]
insertSort a
echo a</
{{out}}
<pre>@[-31, 0, 2, 2, 4, 65, 83, 99, 782]</pre>
=={{header|Oberon-2}}==
{{trans|Modula-3}}
<syntaxhighlight lang="oberon2">MODULE InsertionSort;
IMPORT Out;
VAR
A1:ARRAY 10 OF INTEGER;
PROCEDURE Init;
BEGIN
A1[0] := 4; A1[1] := 65; A1[2] := 2; A1[3] := -31;
A1[4] := 0; A1[5] := 99; A1[6] := 2; A1[7] := 83;
A1[8] := 782; A1[9] := 1;
END Init;
PROCEDURE InsertionSort(VAR A:ARRAY OF INTEGER);
VAR
i,j:LONGINT;
value:INTEGER;
BEGIN
FOR i := 1 TO LEN(A)-1 DO
value := A[i];
j := i-1;
WHILE((j >= 0) & (A[j] > value)) DO A[j+1] := A[j]; DEC(j) END;
A[j+1] := value
END;
END InsertionSort;
PROCEDURE PrintArray(VAR A:ARRAY OF INTEGER);
VAR i:LONGINT;
BEGIN
FOR i := 0 TO LEN(A)-1 DO Out.Int(A[i],0); Out.Char(' ') END;
Out.Ln
END PrintArray;
BEGIN
Init;
PrintArray(A1);
InsertionSort(A1);
PrintArray(A1);
END InsertionSort.
</syntaxhighlight>
{{out}}
<pre>4 65 2 -31 0 99 2 83 782 1
-31 0 1 2 2 4 65 83 99 782
</pre>
=={{header|Objeck}}==
<
bundle Default {
class Insert {
Line 3,517 ⟶ 4,048:
}
}
</syntaxhighlight>
=={{header|OCaml}}==
<
match lst with
| y
|
let insertion_sort = List.fold_left insert []
|> insertion_sort |> List.iter (Printf.printf " %u") |> print_newline</syntaxhighlight>
{{out}}
<pre> 1 2 3 4 5 6 7 8 9</pre>
=={{header|Oforth}}==
Line 3,535 ⟶ 4,067:
Returns a new sorted list.
<
| l i j v |
a asListBuffer ->l
Line 3,548 ⟶ 4,080:
l put(j 1 +, v)
]
l ;</
{{out}}
Line 3,559 ⟶ 4,091:
=={{header|ooRexx}}==
{{trans|REXX}}
<
/* using the insertion sort algorithm */
Call gen /* fill the array with test data */
Line 3,601 ⟶ 4,133:
Say 'Element' right(j,length(x.0)) arg(1)":" x.j
End
Return</
{{out}}
<pre>Element 1 before sort: ---Monday's Child Is Fair of Face (by Mother Goose)---
Line 3,627 ⟶ 4,159:
=={{header|Oz}}==
Direct translation of pseudocode. In-place sorting of mutable arrays.
<
proc {InsertionSort A}
Low = {Array.low A}
Line 3,647 ⟶ 4,179:
in
{InsertionSort Arr}
{Show {Array.toRecord unit Arr}}</
=={{header|PARI/GP}}==
<
for(i=1,#v-1,
my(j=i-1,x=v[i]);
Line 3,660 ⟶ 4,192:
);
v
};</
=={{header|Pascal}}==
{{works with|FPC}}
<syntaxhighlight lang="pascal">
program SortDemo;
{$mode objfpc}{$h+}{$b-}
procedure InsertionSort(var A: array of Integer);
var
I, J, Tmp: Integer;
begin
for I := 1 to High(a) do
if A[I] < A[I - 1] then begin
J := I;
Tmp := A[I];
repeat
A[J] := A[J - 1];
Dec(J);
until (J = 0) or (Tmp >= A[J - 1]);
A[J] := Tmp;
end;
end;
procedure PrintArray(const A: array of Integer);
var
I: Integer;
begin
Write('[');
for I := 0 to High(A) - 1 do
Write(A[I], ', ');
WriteLn(A[High(A)], ']');
end;
var
a: array[-7..6] of Integer = (-34, -20, 30, 13, 36, -10, 5, -25, 9, 19, 35, -50, 29, 11);
begin
InsertionSort(a);
PrintArray(a);
end.
</syntaxhighlight>
{{out}}
<pre>
[-50, -34, -25, -20, -10, 5, 9, 11, 13, 19, 29, 30, 35, 36]
</pre>
=={{header|Perl}}==
<
sub insertion_sort {
my (@list) = @_;
Line 3,683 ⟶ 4,258:
my @a = insertion_sort(4, 65, 2, -31, 0, 99, 83, 782, 1);
print "@a\n";
</syntaxhighlight>
{{out}}
-31 0 1 2 4 65 83 99 782
Line 3,689 ⟶ 4,264:
=={{header|Phix}}==
Copy of [[Sorting_algorithms/Insertion_sort#Euphoria|Euphoria]]
<!--<
<span style="color: #008080;">function</span> <span style="color: #000000;">insertion_sort</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">)</span>
<span style="color: #004080;">object</span> <span style="color: #000000;">temp</span>
Line 3,709 ⟶ 4,284:
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Before: "</span><span style="color: #0000FF;">)</span> <span style="color: #0000FF;">?</span><span style="color: #000000;">s</span>
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"After: "</span><span style="color: #0000FF;">)</span> <span style="color: #0000FF;">?</span><span style="color: #000000;">insertion_sort</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)</span>
<!--</
{{out}}
<pre>
Line 3,717 ⟶ 4,292:
=={{header|PHP}}==
<
for($i=0;$i<count($arr);$i++){
$val = $arr[$i];
Line 3,731 ⟶ 4,306:
$arr = array(4,2,1,6,9,3,8,7);
insertionSort($arr);
echo implode(',',$arr);</
<pre>1,2,3,4,6,7,8,9</pre>
=={{header|PicoLisp}}==
<
(for (I (cdr Lst) I (cdr I))
(for (J Lst (n== J I) (cdr J))
(T (> (car J) (car I))
(rot J (offset I J)) ) ) )
Lst )</
{{out}}
<pre>: (insertionSort (5 3 1 7 4 1 1 20))
Line 3,746 ⟶ 4,321:
=={{header|PL/I}}==
<
insert_sort: proc(array);
dcl array(*) fixed bin(31);
Line 3,764 ⟶ 4,339:
end;
end insert_sort;
</syntaxhighlight>
=={{header|PL/M}}==
<
/* INSERTION SORT ON 16-BIT INTEGERS */
Line 3,812 ⟶ 4,387:
CALL BDOS(0,0);
EOF</
{{out}}
<pre>0 1 2 2 3 4 8 31 65 99 782</pre>
Line 3,818 ⟶ 4,393:
=={{header|PowerShell}}==
Very similar to the PHP code.
<
for($i=0;$i -lt $arr.length;$i++){
$val = $arr[$i]
Line 3,832 ⟶ 4,407:
$arr = @(4,2,1,6,9,3,8,7)
insertionSort($arr)
$arr -join ","</
{{Out}}
<pre>1,2,3,4,6,7,8,9</pre>
=={{header|Prolog}}==
<
insert_sort_intern(L1,[],L2).
Line 3,850 ⟶ 4,425:
!.
insert([H|T],X,[H|T2]) :-
insert(T,X,T2).</
% Example use:
Line 3,860 ⟶ 4,435:
Works with SWI-Prolog.<br>
Insertion sort inserts elements of a list in a sorted list. So we can use foldl to sort a list.
<
isort(L, LS) :-
foldl(insert, [], L, LS).
Line 3,879 ⟶ 4,454:
insert([H | T], N, [H|L1]) :-
insert(T, N, L1).
</syntaxhighlight>
Example use:
<pre> ?- isort([2,23,42,3,10,1,34,5],L).
Line 3,886 ⟶ 4,461:
=={{header|PureBasic}}==
<
Protected low, high
Protected firstIndex, lastIndex = ArraySize(a())
Line 3,905 ⟶ 4,480:
Wend
EndIf
EndProcedure</
=={{header|Python}}==
<
for i in xrange(1, len(L)):
j = i-1
Line 3,915 ⟶ 4,490:
L[j+1] = L[j]
j -= 1
L[j+1] = key</
Using pythonic iterators:
<
for i, value in enumerate(L):
for j in range(i - 1, -1, -1):
if L[j] > value:
L[j + 1] = L[j]
L[j] = value</
===Insertion sort with binary search===
<
for i in range(1, len(seq)):
key = seq[i]
Line 3,940 ⟶ 4,515:
up = middle
# insert key at position ``low``
seq[:] = seq[:low] + [key] + seq[low:i] + seq[i + 1:]</
This is also built-in to the standard library:
<
def insertion_sort_bin(seq):
for i in range(1, len(seq)):
bisect.insort(seq, seq.pop(i), 0, i)</
=={{header|Qi}}==
Based on the scheme version.
<
X [] -> [X]
X [Y|Ys] -> [X Y|Ys] where (<= X Y)
Line 3,961 ⟶ 4,536:
(insertion-sort [6 8 5 9 3 2 1 4 7])
</syntaxhighlight>
=={{Header|Quackery}}==
<
[ swap 2dup findwith
[ over > ] [ ]
nip stuff ] ] is insertionsort ( [ --> [ )</
=={{header|R}}==
Direct translation of pseudocode.
<
{
for(i in 2:(length(x)))
Line 3,986 ⟶ 4,561:
x
}
insertionsort(c(4, 65, 2, -31, 0, 99, 83, 782, 1)) # -31 0 1 2 4 65 83 99 782</
R has native vectorized operations which allow the following, more efficient implementation.
<syntaxhighlight lang="r">
insertion_sort <- function(x) {
for (j in 2:length(x)) {
Line 4,008 ⟶ 4,583:
}
}
</syntaxhighlight>
=={{header|Racket}}==
This implementation makes use of the pattern matching facilities in the Racket distribution.
<
#lang racket
Line 4,022 ⟶ 4,597:
[(cons y rst) (cond [(< x y) (cons x ys)]
[else (cons y (insert x rst))])]))
(foldl insert '() l))</
=={{header|Raku}}==
(formerly Perl 6)
<syntaxhighlight lang="raku"
for 1 .. @a.end -> $i {
my $value = @a[$i];
Line 4,041 ⟶ 4,616:
say 'input = ' ~ @data;
say 'output = ' ~ @data.&insertion_sort;
</syntaxhighlight>
{{out}}
Line 4,049 ⟶ 4,624:
=={{header|Rascal}}==
<
public list[int] insertionSort(a){
Line 4,062 ⟶ 4,637:
}
return a;
}</
{{out}}
<
list[int]: [-31,0,1,2,4,65,83,99,782]</
=={{header|REALbasic}}==
<
for insertionElementIndex as Integer = 1 to UBound(theList)
dim insertionElement as Integer = theList(insertionElementIndex)
Line 4,078 ⟶ 4,653:
theList(j + 1) = insertionElement
next
End Sub</
=={{header|REBOL}}==
<
; This program works with REBOL version R2 and R3, to make it work with Red
; change the word func to function
Line 4,121 ⟶ 4,696:
; just by adding the date! type to the local variable value the same function can sort dates.
probe insertion-sort [12-Jan-2015 11-Jan-2015 11-Jan-2016 12-Jan-2014]
</syntaxhighlight>
{{out}}
Line 4,138 ⟶ 4,713:
[12-Jan-2014 11-Jan-2015 12-Jan-2015 11-Jan-2016]
</pre>
=={{header|Refal}}==
<syntaxhighlight lang="refal">$ENTRY Go {
, 7 6 5 9 8 4 3 1 2 0: e.Arr
= <Prout e.Arr>
<Prout <Sort e.Arr>>;
};
Sort {
(e.S) = e.S;
(e.S) s.I e.X = <Sort (<Insert s.I e.S>) e.X>;
e.X = <Sort () e.X>;
};
Insert {
s.N = s.N;
s.N s.M e.X, <Compare s.N s.M>: {
'+' = s.M <Insert s.N e.X>;
s.C = s.N s.M e.X;
};
};</syntaxhighlight>
{{out}}
<pre>7 6 5 9 8 4 3 1 2 0
0 1 2 3 4 5 6 7 8 9</pre>
=={{header|REXX}}==
<
call gen /*generate the array's (data) elements.*/
call show 'before sort' /*display the before array elements. */
Line 4,169 ⟶ 4,768:
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
show: do j=1 for #; say ' element' right(j,length(#)) arg(1)": " @.j; end; return</
{{out|output|text= when using the default internal data:}}
<pre>
Line 4,196 ⟶ 4,795:
=={{header|Ring}}==
<
alist = [7,6,5,9,8,4,3,1,2,0]
see insertionsort(alist)
Line 4,211 ⟶ 4,810:
next
return blist
</syntaxhighlight>
=={{header|RPL}}==
In RPL, the condition <code>while j > 0 and A[j] > value do</code> needs to be fully assessed before performing the loop: an error would then occur when j will equal zero. This is why the loop condition has been encapsulated in a <code>IFERR..THEN..END</code> structure, which removes the need to test the value of j.
{{works with|Halcyon Calc|4.2.7}}
{| class="wikitable"
! RPL code
! Comment
|-
|
≪ 'A' STO
2 A SIZE '''FOR''' ii
A ii GET
ii 1 -
'''WHILE '''
'''IFERR''' DUP2 A SWAP GET < '''THEN''' 3 DROPN 0 '''END REPEAT'''
'A' OVER GETI PUT
1 -
'''END '''
'A' SWAP 1 + ROT PUT
'''NEXT '''
A 'A' PURGE
≫ 'ISORT' STO
|
''( [array] -- [array] ) ''
for i from 2 to length[A] do ''// RPL arrays starts at 1''
value := A[i]
j := i-1
while
j > 0 and A[j] > value do
A[j+1] := A[j]
j := j-1
done
A[j+1] = value
done
Display result and delete global variable
|}
{{in}}
<pre>
[ 1 4 -1 0 3 7 4 8 20 -6 ] ISORT
</pre>
{{out}}
<pre>
1: [ -6 -1 0 1 3 4 4 7 8 20 ]
</pre>
=={{header|Ruby}}==
<
def insertionsort!
1.upto(length - 1) do |i|
Line 4,230 ⟶ 4,874:
ary = [7,6,5,9,8,4,3,1,2,0]
p ary.insertionsort!
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</
Alternative version which doesn't swap elements but rather removes and inserts the value at the correct place:
<
def insertionsort!
1.upto(length - 1) do |i|
Line 4,247 ⟶ 4,891:
ary = [7,6,5,9,8,4,3,1,2,0]
p ary.insertionsort!
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</
=={{header|Run BASIC}}==
<
sortEnd = 0
global inSort
Line 4,280 ⟶ 4,924:
insSort(i) = x
sortEnd = sortEnd + 1
end function</
<pre>End Sort:20
1 124
Line 4,298 ⟶ 4,942:
=={{header|Rust}}==
<
for i in 1..arr.len() {
let mut j = i;
Line 4,306 ⟶ 4,950:
}
}
}</
=={{header|SASL}}==
Copied from SASL manual, Appendix II, answer (2)(a)
<syntaxhighlight lang="sasl">DEF
sort () = ()
sort (a : x) = insert a (sort x)
Line 4,316 ⟶ 4,960:
insert a (b : x) = a < b -> a : b : x
b : insert a x
?</
=={{header|Scala}}==
<
def insert(list: List[X], value: X) = list.span(x => ord.lt(x, value)) match {
case (lower, upper) => lower ::: value :: upper
}
list.foldLeft(List.empty[X])(insert)
}</
=={{header|Scheme}}==
<
(if (null? lst)
(list x)
Line 4,342 ⟶ 4,986:
(insertion-sort (cdr lst)))))
(insertion-sort '(6 8 5 9 3 2 1 4 7))</
=={{header|Seed7}}==
<
local
var integer: i is 0;
Line 4,360 ⟶ 5,004:
arr[j] := help;
end for;
end func;</
Original source: [http://seed7.sourceforge.net/algorith/sorting.htm#insertionSort]
=={{header|Sidef}}==
<
method insertion_sort {
{ |i|
Line 4,381 ⟶ 5,025:
var a = 10.of { 100.irand }
say a.insertion_sort</
=={{header|SNOBOL4}}==
<
A = table()
i = 0
Line 4,403 ⟶ 5,047:
* output sorted data
while output = A<i>; i = ?lt(i,aSize) i + 1 :s(while)
end</
=={{header|Stata}}==
<
void insertion_sort(real vector a) {
real scalar i, j, n, x
Line 4,420 ⟶ 5,064:
}
}
end</
=={{header|Swift}}==
Using generics.
<
for i in 1..<list.count {
var j = i
Line 4,433 ⟶ 5,077:
}
}
}</
=={{header|Tcl}}==
<
proc insertionsort {m} {
Line 4,451 ⟶ 5,095:
}
puts [insertionsort {8 6 4 2 1 3 5 7 9}] ;# => 1 2 3 4 5 6 7 8 9</
=={{header|TI-83 BASIC}}==
Line 4,478 ⟶ 5,122:
=={{header|uBasic/4tH}}==
<syntaxhighlight lang="text">PRINT "Insertion sort:"
n = FUNC (_InitArray)
PROC _ShowArray (n)
Line 4,526 ⟶ 5,170:
PRINT
RETURN</
=={{header|UnixPipes}}==
<
read a
test -n "$a" && ( selectionsort | sort -nm <(echo $a) -)
}</
<syntaxhighlight lang
=={{header|Ursala}}==
<
insort = ~&i&& @hNCtX ~&r->lx ^\~&rt nleq-~rlrSPrhlPrSCPTlrShlPNCTPQ@rhPlD</
test program:
<
example = insort <45,82,69,82,104,58,88,112,89,74></
{{out}}
<pre>
Line 4,550 ⟶ 5,194:
=={{header|Vala}}==
{{trans|Nim}}
<
var count = 0;
for (int i = 1; i < array.length; i++) {
Line 4,568 ⟶ 5,212:
foreach (int i in array)
print("%d ", i);
}</
{{out}}
<pre>
Line 4,575 ⟶ 5,219:
=={{header|VBA}}==
{{trans|Phix}}<
Private Function insertion_sort(s As Variant) As Variant
Dim temp As Variant
Line 4,596 ⟶ 5,240:
Debug.Print "Before: ", Join(s, ", ")
Debug.Print "After: ", Join(insertion_sort(s), "' ")
End Sub</
<pre>Before: 4, 15, delta, 2, -31, 0, alpha, 19, gamma, 2, 13, beta, 782, 1
After: -31' 0' 1' 2' 2' 4' 13' 15' 19' 782' alpha' beta' delta' gamma</pre>
Line 4,602 ⟶ 5,246:
=={{header|VBScript}}==
{{trans|REALbasic}}
<
Dim n(9) 'nine is the upperbound.
'since VBS arrays are 0-based, it will have 10 elements.
Line 4,638 ⟶ 5,282:
Next
End Sub
</syntaxhighlight>
{{Out}}
<pre>ORIGINAL : 26699;2643;10249;31612;21346;19702;29799;31115;20413;5197;
SORTED : 2643;5197;10249;19702;20413;21346;26699;29799;31115;31612;</pre>
=={{header|V (Vlang)}}==
<syntaxhighlight lang="v (vlang)">fn insertion(mut arr []int) {
for i in 1 .. arr.len {
value := arr[i]
Line 4,661 ⟶ 5,305:
insertion(mut arr)
println('Output: ' + arr.str())
}</
{{out}}
<pre>Input: [4, 65, 2, -31, 0, 99, 2, 83, 782, 1]
Line 4,667 ⟶ 5,311:
=={{header|Wren}}==
<
for (i in 1..a.count-1) {
var v = a[i]
Line 4,679 ⟶ 5,323:
}
var
for (a in
System.print("Before: %(a)")
insertionSort.call(a)
System.print("After : %(a)")
System.print()
}</
{{out}}
Line 4,698 ⟶ 5,342:
Alternatively we can just call a library method.
{{libheader|Wren-sort}}
<
var
for (a in
System.print("Before: %(a)")
Sort.insertion(a)
System.print("After : %(a)")
System.print()
}</
{{out}}
Line 4,714 ⟶ 5,358:
=={{header|XPL0}}==
<
proc InsertionSort(A, L); \Sort array A of length L
Line 4,734 ⟶ 5,378:
InsertionSort(A, 10);
for I:= 0 to 10-1 do [IntOut(0, A(I)); ChOut(0, ^ )];
]</
{{out}}
Line 4,744 ⟶ 5,388:
=={{header|Yabasic}}==
{{trans|FreeBASIC}}
<
sub InsertionSort (matriz())
for i = 1 to arraysize(matriz(),1)
Line 4,774 ⟶ 5,418:
print
end
</syntaxhighlight>
=={{header|Yorick}}==
Based on pseudocode, except using 1-based arrays.
<
for(i = 2; i <= numberof(A); i++) {
value = A(i);
Line 4,789 ⟶ 5,433:
A(j+1) = value;
}
}</
=={{header|zkl}}==
<
sink:=List();
foreach x in (list){
Line 4,799 ⟶ 5,443:
}
sink.close();
}</
<
insertionSort("big fjords vex quick waltz nymph".split()).println();</
{{out}}
<pre>
| |||