微机原理冒泡排序

template <class T> T Stack<T>::Pop(){
if(IsEmpty()) cout<<"OutOfBounds"<<endl;
T x=stack[top]; top--; return x; } #include <iostream> #include <time.h> #include <stdlib.h>
}
FindPath(maze,row,col); return 0; } //寻找一个从[1,1]到[m,m]的路径 void FindPath(int **maze,int row,int col){ Stack<Position> path; Position offset[4]; offset[0].row = 0; offset[0].col = 1; //向右 offset[1].row = 1; offset[1].col = 0; //向下 offset[2].row = 0; offset[2].col =-1; //向左 offset[3].row =-1; offset[3].col = 0; //向上 Position here; here.row=1; here.col=1; maze [1][1] = 1; // 阻止返回入口 int option = 0; int LastOption = 3; //寻找一条路径 while (here.row != row || here.col != col) { // 不是出口 //寻找一个相邻位置来移动
if (path.IsEmpty()) cout<<"There is no path!"<<endl;
Position next; next=path.Pop(); //计算 option 的值 if (next.row == here.row)
option = 2 + next.col - here.col; else
#include "Stack.h"
#include "Position.h"
using namespace std;
void FindPath(int**,int,int);
int main(){ //生成随机数
srand(time(NULL));
int row,col;
int i=0,j=0;
//初始化数组，给迷宫加围墙 1
for( j = 0 ; j < col+2 ; j ++ )
maze[i][j]=1; for( i = 1 ; i < row+1 ; i ++ )
//将迷宫载入数组 maze 中
for( j = 1 ; j < col+1 ; j ++ ) maze[i][j]=rand()%2; //产生 0 或 1
int **maze; cout<<"请输入迷宫的大小："<<endl;
cin>>row>>col;
maze=new int*[row+1];
for(i = 0 ; i < row+2 ; i ++ )
maze[i] = new int[col+2] ; for( i = 0 ; i < row+2 ; i ++ )
bool IsEmpty() const{return top==-1;}
bool IsFull() const{return top==MaxTop;}
T Top() const;
void Push(const T& x);
T Pop();
private:
int top; //当前栈顶
int MaxTop; //栈顶最大值
T *stack;
//空指针
};
#endif /* STACK_ */
template <class T>
Stack<T>::Stack(int MaxSize){
MaxTop=MaxSize-1;
stack=new T[MaxSize];
top=-1; }
//栈顶=栈底
template <class T> T Stack<T>::Top() const{
if(IsEmpty()) cout<<"OutOfBounds"<<endl;
else return stack[top];
}
template <class T> void Stack<T>::Push(const T& x){
if(IsFull()) cout<<"NoMem"<<endl;
top++; stack[top]=x; }
class Position
{
public: int row; //行坐标 int col; //列坐标
ቤተ መጻሕፍቲ ባይዱ
};
#ifndef STACK_
#define STACK_
#include <iostream.h> //自定义的堆栈
template <class T>
class Stack{
public:
Stack(int MaxSize=15);
maze[1][1]=0;
maze[row][col]=0;
cout<<"The maze is:"<<endl;
for( i = 1 ; i < row+1 ; i ++ ){
for( j = 1 ; j < col+1 ; j ++ ){
cout<<maze[i][j]<<" ";
}
cout<<endl;
int r, c; while (option <= LastOption) {
r = here.row + offset[option].row ; c = here.col + offset[option].col ; if (maze[r][c] == 0)
break; option++; //下一个选择 } // 找到一个相邻位置了吗?
if (option <= LastOption) { //移动到 maze[r][c] path.Push(here); //将此位置放到堆栈中 here.row = r; here.col = c; maze [r][c] = 1; //设置障碍物以阻止再次访问 option=0;
} else { //没有可用的相邻位置，回溯
option = 3 + next.row - here.row; here = next; } } here.row=row; here.col=col; path.Push(here); cout<<"由出口回朔到入口打印路径:"<<endl; while(!path.IsEmpty()){ Position a=path.Pop(); cout<<"("<<a.row<<","<<a.col<<") "; } cout<<endl; }