Question

1. Suppose you have three stacks. Stack source is full of random data and stacks aux and dest are empty To sort the data in the source, you can repeatedly remove the largest value by popping each item off of source and pushing it onto aux, remembering the maximum value seen as you empty source. When source is empty, you pop each item off of aux and push it back onto source except for the largest one that you remembered, which you push to dest instead. If you repeat this process until both source and aux are empty, then you can pop the contents of dest in increasing order, successfully sorting the contents of the original stack.

   What is the worst-case performance of stacksort?

Answer 1

If you find the answer useful don't forget to hit "Upvote" button and if there is any problem, you are free to ask and I would be happy to solve it ask in the comment section below.

You would need to unerstand the best and worst both.

And here is the explanation.