Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

tasreeb

  • 3 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
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    using which language?

  2. tasreeb
    • 3 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

Sign Up
Find more explanations on OpenStudy
Privacy Policy