算法与数据结构课程设计参考.docxVIP

算法与数据结构课程设计姓名：学号：实验1设计循环单链表的结点结构，并按要求处理函数和过程void fun(Node *head,int *len){if(head==null)return ;Node *p=head;while(p!=null){ p=p-next; //输出节点中的数据printf(....,...); //节点数加1 *len++;}}实验2设有n个人围坐成一圈，按要求报数，每次淘汰一个，知道所有人淘汰。试用数据结构表示出来#includestdio.h#includestdlib.hintn,s,m,out,a[100]; /*n为所有人数，out为出局的人*/voidjosegh( );void main(){int i;printf (n = ); scanf (%d, n);printf (s = ); scanf (%d, s);printf (m = ); scanf (%d, m);for (i = 1; i =n; i++) /*定义数组a[100],按顺序赋值 */a[i] = i;while (n != 0)josegh ( );system(pause);}void josegh ( ) /*每当出局一个人，n减1，数组重新排列*/{out = s + m - 1;while (out n)out-= n;printf (o = %d\n,a[out]);n--;s=out;while (out = n)a[out++] = a[out+1];}实验3设单链表中存放n个字符，试用栈判断该字符串是否对称，如xyzzyx。#includecstdio#includecstdlib#includecstring#define LEN sizeof(struct node)#define MAX 147struct node{char cc;struct node *next;};int judge(struct node *head,intlen){struct node *top,*p1,*p2;top = NULL;p1 = head-next;for(int i = 0 ; i len/2 ; i++){p2 = (struct node *)malloc(LEN);p2-cc = p1-cc;p2-next = top;top = p2;p1 = p1-next;}if(len%2 == 1)p1 = p1-next;p2 = top;for(i = 0 ; i len/2 ; i++){if(p2-cc != p1-cc)break;top = p2-next;p1 = p1-next;p2 = top;}if(!top) return 1;elsereturn 0;}int main(){int n=0;charstr[MAX];struct node *head,*p;head = p = (struct node *)malloc(LEN);head-next = p-next = NULL;printf(亲、请输入一个字符串：\n);gets(str);intlen = strlen(str);while(n len str[0] != \n){p = (struct node *)malloc(LEN);p-cc = str[n];p-next = head-next;head-next = p;n++;}int flag = judge(head,len);if(flag)printf(%s是一个回文!\n,str);elseprintf(%s不是一个回文!\n,str);return 0;}实验4对给定任意图建立邻接表并输出，实现图的广度优先遍历#include iostream//#include malloc.h#define INFINITY 32767#define MAX_VEX 20 //最大顶点个数#define QUEUE_SIZE (MAX_VEX+1) //队列长度using namespace std;bool *visited; //访问标志数组//图的邻接矩阵存储结构typedefstruct{ char *vexs; //顶点向量int arcs[MAX_VEX][MAX_VEX]; //邻接矩阵intvexnum,arcnum; //图的当前顶点数和弧数}Graph;//队列类class Queue{public:voidInitQueue(){base=(int *)malloc(QUEUE_SIZE*sizeof(