List Merge Function using Prolog Source Code
The following code merges two list in ascending order.
merge([],Ys,Ys).
merge(Xs,[],Xs).
merge([X|Xs],[Y|Ys],[X|R]):- X<Y,merge(Xs,[Y|Ys],R).
merge([X|Xs],[Y|Ys],[Y|R]):-X>Y,merge([X|Xs],Ys,R).
merge([X|Xs],[X|Ys],[X,X|R]):-merge(Xs,Ys,R).
Related Articles
- Appends Two Lists using Prolog Source Code
- Delete all occurrences of an Element from a List using Prolog Source Code
- Delete the Nth Element from the List using Prolog Source Code
- List Length Function using Prolog Source Code
- List Member Function using Prolog Source Code
- MergeSort Function using Prolog Source Code
- Powersort Function using Prolog Source Code
- QuickSort Function using Prolog Source Code