Sort a stack without using auxiliary stacks or arrays - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Programming - 葵花宝典

Sort a stack without using auxiliary stacks or arrays

Sort a stack without using auxiliary stacks or arrays# Programming - 葵花宝典

b*a2008-05-18 07:05

1 楼

Design an efficient algorithm to sort elements in a stack in either
ascending/descending order, using only pop(), top(), push(), isEmpty(),
isFull(). Do not use any auxiliary stacks or arrays.
I found this question in jobhunting board. the anwser given by a niu ren is
Is this right? Does not look like right one.Thanks.

c*t2008-05-18 07:05

2 楼

You didn't post the complete code. What you looked at was mostly a
for-loop.

is

【在 b**a 的大作中提到】

: Design an efficient algorithm to sort elements in a stack in either
: ascending/descending order, using only pop(), top(), push(), isEmpty(),
: isFull(). Do not use any auxiliary stacks or arrays.
: I found this question in jobhunting board. the anwser given by a niu ren is
: Is this right? Does not look like right one.Thanks.

E*V2008-05-18 07:05

3 楼

seems right
why dont' you test it?

is

【在 b**a 的大作中提到】

w*g2008-05-18 07:05

4 楼

This is a recursive algorithm, and it actually uses an auxiliary stack
, though not obvious to newbies. This is actually more dangerous than
explicitly using some auxiliary data structure because recursion may lead to
stack overflow.

is

【在 b**a 的大作中提到】