This project is developed using Java and it will be useful for anyone who wants to know all the possible permutations for a set of numbers.

The project is developed using Java and the main aim of this project is to generate all the possible permutations (without any repetition of a number in a permutation) for a given set of numbers.

When a user executes the project, the user will be asked to enter the number of elements for which all the possible permutations have to be generated. The number of elements has to be 3 or more as a set of 2 numbers has only 2 permutations i.e the set of the numbers and its reverse. For example, a set of numbers (1, 2) has only 2 permutations i.e 1 2 and 2 1.

Once the user enters the number of elements, the user will be prompted to enter the actual elements (numbers) one by one. After the user enters the last element and presses enter, the given array of elements is displayed followed by all the possible permutations (without any repetition of a number in a permutation) that can be generated using the numbers provided as input. At the end, the total number of permutations generated is also displayed.

This project will be useful for anyone who wants to know all the possible permutations for a set of numbers.

Screenshots:

Submitted by J Satya Srinivas (satyasrinivasj)

Download packets of source code on Coders Packet

## Comments