Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(Added code for Prolog) |
(→{{header|Prolog}}: Added spaces to have one verbatim block) |
||
Line 121: | Line 121: | ||
insert_sort(L1,L2) :- |
insert_sort(L1,L2) :- |
||
insert_sort_intern(L1,[],L2). |
insert_sort_intern(L1,[],L2). |
||
insert_sort_intern([],L,L). |
insert_sort_intern([],L,L). |
||
insert_sort_intern([H|T],L1,L) :- |
insert_sort_intern([H|T],L1,L) :- |
||
insert(L1,H,L2), |
insert(L1,H,L2), |
||
insert_sort_intern(T,L2,L). |
insert_sort_intern(T,L2,L). |
||
insert([],X,[X]). |
insert([],X,[X]). |
||
insert([H|T],X,[X,H|T]) :- |
insert([H|T],X,[X,H|T]) :- |
||
Line 133: | Line 133: | ||
insert([H|T],X,[H|T2]) :- |
insert([H|T],X,[H|T2]) :- |
||
insert(T,X,T2). |
insert(T,X,T2). |
||
% Example use: |
% Example use: |
||
% ?- insert_sort([2,23,42,3,10,1,34,5],L). |
% ?- insert_sort([2,23,42,3,10,1,34,5],L). |