Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 10:07, 24 January 2008
, 16 years agoAdded code for Prolog
(Added Ada) |
(Added code for Prolog) |
||
Line 117:
}
}
=={{header|Prolog}}==
insert_sort(L1,L2) :-
insert_sort_intern(L1,[],L2).
insert_sort_intern([],L,L).
insert_sort_intern([H|T],L1,L) :-
insert(L1,H,L2),
insert_sort_intern(T,L2,L).
insert([],X,[X]).
insert([H|T],X,[X,H|T]) :-
X =< H,
!.
insert([H|T],X,[H|T2]) :-
insert(T,X,T2).
% Example use:
% ?- insert_sort([2,23,42,3,10,1,34,5],L).
% L = [1,2,3,5,10,23,34,42] ?
% yes
=={{header|Python}}==
|