simtower.cpp

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等

#include <iostream.h>
#include <stdlib.h>

struct  DataType
{
	short int retAddr;
	int nParam;
	char fromParam;
	char auxParam;
	char toParam;
};

const int MaxStackSize = 10;
#include "SeqStack.h"

void SimTowers(int n, char fromPeg, char auxPeg, char toPeg)
{
	DataType  currArea;
	SeqStack  s;
	char      temp;
	short int i;

	//当前工作区初始化
	currArea.retAddr   = 1;
	currArea.nParam    = n;
	currArea.fromParam = fromPeg;
	currArea.auxParam  = auxPeg;
	currArea.toParam   = toPeg;

	s.Push(currArea);

	//以下为模拟出口
start:
	if(currArea.nParam == 1)
	{
		cout << "Move Disk 1 from Peg " << currArea.fromParam
			<< " to Peg " << currArea.toParam << endl;
		i = currArea.retAddr;
		currArea = s.Pop();
		switch(i)
		{
			case 1: goto lable1;
			case 2: goto lable2;
			case 3: goto lable3;
		}
	}

	//以下模拟递归自调用过程
	s.Push(currArea);

	currArea.nParam   --;
	temp              = currArea.auxParam;
	currArea.auxParam = currArea.toParam;
	currArea.toParam  = temp;
	currArea.retAddr  = 2;

	goto start;

	//以下模拟返回第一次递归调用
lable2:
	cout << "Move Disk " << currArea.nParam << " from Peg "
		<< currArea.fromParam << " to Peg " 
		<< currArea.toParam << endl;
	
	s.Push(currArea);

	currArea.nParam    --;
	temp               = currArea.fromParam;
	currArea.fromParam = currArea.auxParam;
	currArea.auxParam  = temp;
	currArea.retAddr   = 3;

	goto start;

	//以下模拟返回第二次递归调用
lable3:
	i = currArea.retAddr;
	currArea = s.Pop();
	switch(i)
	{
		case 1: goto lable1;
		case 2: goto lable2;
		case 3: goto lable3;
	}

	//以下模拟返回主调函数
lable1:
	return;
}

void main(void)
{
   int n = 3;
	
   SimTowers(n,'A','B','C');
}