开发者

Stack Complexity [closed]

开发者_如何学运维 It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 12 years ago.

How to calculate the Complexity of the Stack? Yes, I mean the various operations of Stack (Push, Pop). How it can be said that the complexity for these operations will be O(1).


  • Pop Θ(1)

  • Push Θ(1)

Because this operations not depends on size of stack and not depends on nothing.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜