What is the time complexity of Heap’s algorithm? – McqOptions

MCQOPTIONS

1.	What is the time complexity of Heap’s algorithm?
A.	O(n log n)
B.	O(n2)
C.	O(n*n!)
D.	O(n!)
Answer» E.

Discussion

No Comment Found

Related MCQs

What will be the output of the code that generates permutations and also has the ability to handle duplicates, for the input str[]=”AA”?
What is the time complexity of Heap’s algorithm?
Heap’s algorithm requires an auxiliary array to create permutations.