How do you describe a stack as an ADT
And how do you check for the run-time difference between bubblesort and insertion sort,
KUNZY
How do you describe a stack as an ADT
And how do you check for the run-time difference between bubblesort and insertion sort,
KUNZY
Hmmmm... sounds like homework to me....
>>How do you describe a stack as an ADT
Describe a stack of plates at Denny's and you're done. :-)
>>And how do you check for the run-time difference between bubblesort and insertion sort
A profiler is the best way.
*Cela*
yea it is homework, could you help me please
Like Cela said, describe a stack of plates and you're finished. First on first off.
That is wrong...
It is LIFO
Last In First Out
Not
FIFO (that would be a queue)
Your Back-Forward buttons on your internet browser work like a stack. Every time you visit a page, that page gets added to the top of the stack. As you go back, you work your way down the stack (Last-in First-out). If you back-down a couple of pages and then visit a new site. The old (First) stuff remains untouched.
Try a search on I just love google.
or
here
and I´m sure you will find your answer.