1 votes 1 votes Is any operations in stack array implementation is linear time complexity? If there what is operation and explain abt that? DS data-structures stack + – Registered user 7 asked Aug 27, 2016 recategorized Sep 16, 2016 by sourav. Registered user 7 716 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 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. sourav. answered Sep 16, 2016 sourav. comment Share Follow See all 0 reply Please log in or register to add a comment.