Question: Write a function in SWI prolog programming languge named, permutations, that takes a list as input and generates a list containing all possible permutations of

Write a function in SWI prolog programming languge named, "permutations", that takes a list as input and generates a list containing all possible permutations of the list elements. Here is a sample application:

?- permutations([1,2,3],X).

X=[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Yes

?-

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!