Heap's Algorithm is used to generate all the possible permutation of n-decimals of a number. It generates each permutation from the previous one by interchanging a single pair of elements; the other nβ2 elements are not disturbed. For N numbers, it takes O(N!) time complexity