a) O (N)
b) O (N log N)
c) O (M log N)
d) O (N2)
Answer: a
Explanation: The time complexity of balancing parentheses algorithm is mathematically found to be O (N).
Related Posts
Which one of the following operations returns the first occurrence of bit 1 in bit arrays?
Bit fields and Bit arrays are same.
What does Hamming weight/population count mean in Bit arrays?
Run-Length encoding is used to compress data in bit arrays.
Which of the following bitwise operator will you use to invert all the bits in a bit array?
Which class in Java can be used to represent bit array?
Which of the following is/are not applications of bit arrays?
Join The Discussion