Permutation Algorithm Analysis and Updation

This paper provides a new way to generate permutations of a given input in lesser time using the concept of parallel programming. More than forty algorithms have been proposed to date for generating permutations of N elements. Few of these algorithms have been implemented using C++ language and the time taken for processing the input has been compared for these algorithms. Also, the problems and drawbacks of these algorithms have been explained which are related to the code and execution time. This report is not only a survey of permutation methods but also provides a way to compare different algorithms for a given input using some time-related functions.