经典算法题

prim(n, 2);

}

6、寻找迷宫的一条出路，o：通路； X：障碍。（大家经常谈到的一个小算法题）

#define MAX_SIZE 8

int H[4] = {0, 1, 0, -1};

int V[4] = {-1, 0, 1, 0};

char Maze[MAX_SIZE][MAX_SIZE] = {{'X','X','X','X','X','X','X','X'},

{'o','o','o','o','o','X','X','X'},

{'X','o','X','X','o','o','o','X'},

{'X','o','X','X','o','X','X','o'},

{'X','o','X','X','X','X','X','X'},

{'X','o','X','X','o','o','o','X'},

{'X','o','o','o','o','X','o','o'},

{'X','X','X','X','X','X','X','X'}};

void FindPath(int X, int Y) {

if(X == MAX_SIZE || Y == MAX_SIZE) {

for(int i = 0; i < MAX_SIZE; i++)

for(int j = 0; j < MAX_SIZE; j++)

printf(\'\\n');

}else for(int k = 0; k < 4; k++)

if(X >= 0 && Y >= 0 && Y < MAX_SIZE && X < MAX_SIZE && 'o' == Maze[X][Y]) {

Maze[X][Y] = ' ';

FindPath(X+V[k], Y+H[k]);

Maze[X][Y] ='o';

}

}

int main(int argc, char* argv[]) {

FindPath(1,0);

}

7、随机分配座位，共50个学生，使学号相邻的同学座位不能相邻(早些时候用C#写的，没有用C改写）。

static void Main(string[] args)

{

int Tmp = 0, Count = 50;

int[] Seats = new int[Count];

bool[] Students = new bool[Count];

System.Random RandStudent=new System.Random();

Students[Seats[0]=RandStudent.Next(0,Count)]=true;

for(int i = 1; i < Count; ) {

Tmp=(int)RandStudent.Next(0,Count);

if((!Students[Tmp])&&(Seats[i-1]-Tmp!=1) && (Seats[i-1] - Tmp) != -1) {

Seats[i++] = Tmp;

Students[Tmp] = true;

}

}

foreach(int Student in Seats)

System.Console.Write(Student + \

System.Console.Read();

}