What is the time complexity of the above code? Options: A . &nbspO(logn) B . &nbspO(n) C . &nbspO(1) D . &nbspO(nlogn)

What is the time complexity of the above code?

Question

What is the time complexity of the above code?

Options:

A . O(logn)

B . O(n)

C . O(1)

D . O(nlogn)

Answer: Option B

All the characters in the string have to be processed, hence the complexity is O(n).

Was this answer helpful ?

Next Question

Question 1. What is the time complexity for converting decimal to binary numbers? ....

Question 2. Using stacks, how to obtain the binary representation of the number? ....

Question 3. Which data structure can be used to test a palindrome? ....

Question 4. What is the number of moves required in the Tower of Hanoi problem for k disks? ....

Question 5. Select the appropriate code which reverses a word. ....

Question 6. Select the appropriate code which tests for a palindrome. ....

Question 7. Which among the following is not a palindrome? ....

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0