1.

What will be the time complexity of the code to print combinations?

A. O(n)
B. O(n<sup>2</sup>)
C. O(n log n)
D. O(2<sup>n</sup>)
Answer» E.


Discussion

No Comment Found