Q. If an algorithm has complexity O(2^n), it is considered:

यदि किसी एल्गोरिदम में जटिलता O(2^n) है, तो इसे माना जाता है:

A
Polynomial time
B
Exponential time
C
Logarithmic time
D
Constant time

Explanation

Explanation will be available soon. Please stay tuned.

व्याख्या जल्द ही उपलब्ध होगी। कृपया बने रहें।

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

More From This Topic

Related Questions

Related Topics

Analysis of Algorithms Elementary Data Types Arrays, Linked Lists Searching and Sorting Algorithms Basics of C++ and There Classes & Object Trees

Comments

Leave a Comment

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

People Also Search For

Illustration of a clipboard with a checklist and pencil, bright and colorful style

Ready for a Challenge?

Take our Free timed mock tests to sharpen your skills and boost your confidence!