Powersort Function using Prolog Source Code
The following code sorts lists
subset([],[]).
subset(S, [|T]) :- subset(S,T).
subset([H|S],[H|T]) :- subset(S,T).
powerset(Set,PowerSet) :- bagof(S,subset(S,Set),Powerset).
num(X,[X|T],T).
num(X,[H|T],[H|B]) :- num(X,T,B).
subset([],_).
subset([H|T],A) :- num(H,A,B), subset(T,B).
powerset(Set,Powerset) :- setoff(S, subset(S,Set), Powerset).
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
- List Merge Function using Prolog Source Code
- MergeSort Function using Prolog Source Code
- QuickSort Function using Prolog Source Code
