Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

tasreeb

  • 2 years ago

here is an algorithm plz let me know its implemention PUSH(STACK,TOP,MAXSTK,ITEM) this procedure pushes an item onto a stack. 1.[stack already filled?] if TOP=MAXSTK,then:print:OVERFLOW,andReturn. 2.set TOP:=TOP+1.[incrases TOP by 1.] 3.set STACK[TOP]:=ITEM.[Insert ITEM in new TOP position.] 4.Return.

  • This Question is Closed
  1. Matrix65
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    using which language?

  2. tasreeb
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    in c++.

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.