The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
2 views
The running time of amortized stack of the most n elements is 
  1. Push = 2, pop = 0, Make Empty = 0 
  2. Push = 1, pop = 1, Make Empty = n
  3. Push = 1 or n, pop = 1 or (n − 1), Make Empty = 1 
  4. Push = 3, pop = 2, Make Empty = 1 
in Mathematical Logic by Veteran (400k points) | 2 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
asked Jul 24 in Numerical Ability by gatecse Boss (18.4k points) | 0 views
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
49,721 questions
53,593 answers
185,825 comments
70,878 users