Q. If an algorithm takes constant time to execute regardless of input size, its time complexity is:

यदि किसी एल्गोरिदम को इनपुट आकार की परवाह किए बिना निष्पादित होने में निरंतर समय लगता है, तो इसकी समय जटिलता है:

A
O(n)
B
O(n log n)
C
O(1)
D
O(n²)

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

Stacks and Queues Searching and Sorting Algorithms Trees Object-Oriented Concepts Elementary Data Types Arrays, Linked Lists

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!