Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
384 views
in Information Technology by (120k points)
closed by
What is the time complexity of reversing a word using stack algorithm?

(a) O (N log N)

(b) O (N^2)

(c) O (N)

(d) O (M log N)

1 Answer

0 votes
by (121k points)
selected by
 
Best answer
Correct choice is (c) O (N)

For explanation: The time complexity of reversing a stack is mathematically found to be O (N) where N is the input.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...