Ch3-6: sorting a stack in an ascending order

纯黑老白

于 2014-01-15 17:49:29 发布

阅读量711

点赞数

CC 4.0 BY-SA版权

分类专栏： ctci

本文链接：https://blog.youkuaiyun.com/asicprogrammer/article/details/18317137

ctci 专栏收录该内容

34 篇文章

订阅专栏

本文探讨如何仅使用一个额外栈来模仿选择排序，并通过两个额外栈来模仿归并排序或快速排序。代码实现详细解释了算法逻辑及运行过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

if only use 1 additional stack, then mimic the selection sort.

or with 2 additional stacks, we can mimic merge sort or quick sort.

Full code:

// solution for Ch3-6 by mimicing selection sort
// check CTCI book, it's description is more clear than Hawstein
#include 
#include 
#include 
using namespace std;

stack Ssort(stack s){
	stack t;
	while(!s.empty()){
		int data = s.top();
		s.pop();
		while(!t.empty() && t.top()>data){ // condition 1 will take several inner loop
			s.push(t.top());
			t.pop();
		}
		t.push(data); // condition 2 will take a several outer loop
	}
	return t;
}

int main(){
    srand((unsigned)time(0));
    stack s;

    for(int i=0; i<10; ++i)
        s.push((rand()%100));
    s = Ssort(s);
    while(!s.empty()){
        cout<Executing the program....
$demo 
77 72 71 65 65 43 32 29 10 3