The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
139 views
Is any operations in stack array implementation is linear time complexity?

If there what is operation and explain abt that?
asked in DS by Junior (853 points)
recategorized by | 139 views

1 Answer

0 votes

Basic Operations of stack -:push and Pop takes constant time $\Omega \left ( 1 \right )$,But searching an element will take $O\left ( n \right )$ as in the worst case you may have to pop 'n' element to get the key if the key is present at the bottom of stack.

Note -:Searching is not basic operation of stack.

answered by Veteran (15.5k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,017 questions
36,844 answers
91,378 comments
34,721 users