#include <stdio.h>
#define MAXSIZE 10
typedef int ElemType;
typedef struct
{
ElemType elem[MAXSIZE];
int last;
}SeqList;
int Locate(SeqList L,ElemType e)
{int i=0;
while((i<=L.last)&&(L.elem[i]!=e))
{
i++;
}
if(i<=L.last)
return(i+1);
else
return(-1);
}
void main()
{
int i,m;
printf("请输入五个数字");
ElemType e=8;
SeqList *L;
L->last=-1;
for(i=0;i<=4;i++)
{
scanf("%d",&L->elem[i]);
L->last++;
}
m=Locate(*L,e);
printf("%d",m);
if (m==-1)
printf("can't found!");
else
printf("congratulations!");
}

#include <stdio.h>
typedef char ElemType;
typedef struct Node
{
ElemType data;
struct Node *next;
}Node,*LinkList;
InitList(LinkList *H)
{
*H=(LinkList)malloc(sizeof(Node));
(*H)->next=NULL;
}
void CreateFromTail(LinkList H)
{
Node *s;
char c;
int flag=1;
while(flag)
{
c=getchar();
if(c!='$')
{
s=(Node*)malloc(sizeof(Node));
s->next=H->next;
H->next=s;
}
else flag=0;
}
}

雅可比迭代法：
A=[10,-1,-2;-1,10,-2;-1,-1,5];
b=[72;83;42];
if(any(diag(A))==0)
error('error,pause')
end
eps=input('误差限eps=');
N=input('迭代次数N=');
D=diag(diag(A));
B=inv(D)*(D-A);
f=inv(D)*b;
K=0;
x0=zeros(size(b));
while 1
x1=B*x0+f
K=K+1;
formatSpec='第/次迭代的近似解为';
fprintf(formatSpec,K)
disp(x1');
if norm(x1-x0,inf)<eps
fprintf('满足精度要求的解为\n')
disp(x1');
break
end
if K>N
fprintf('迭代超限')
end
x0=x1;
end

#include "stdafx.h"
#include<iostream.h>
#include <stdio.h>
#define M 100
typedef int ElemType;
typedef struct
{
int data[M];
int top;
}DqStack;
void InitStack(DqStack &S)
{
S->top=-1;
}
int Push(DqStack &S,int x)
{
if(S->top==M)
return 0;
else
{S->top++;
S->data[S->top]=x;
return 1;
}
}
int pop(DqStack &S,int &x)
{
if(S->top=-1)
return 0;
else
{
x=S->data[S->top];
S->top--;
return 1;
}
}
void display(DqStack &S)
{
int x;
while(S->top!=-1)
{
pop(S,x);
printf("%x",x);
}
}
void func(int n,int m)
{
DqStack s;
InitStack(S);
while(n!=0)
{
push(S,n%m);
n=n/m;
}
display(S);
}
int main(int argc,char* argv[])
{
int n;
printf("\n请输入一个数：");
scanf("%d",&n);
int m=2;
func(n,m);
m=8;
func(n,m);
m=16;
func(n,m);
return 0;
}

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 20
#define TRUE 1
#define FALSE 0
typedef int QueueElementType;
typedef struct
{
QueueElementType element[MAXSIZE];
int front;
int rear;
}SeqQueue;
void InitQueue(SeqQueue *Q)
{
Q->front=Q->rear=0;
}
int EnterQueue(SeqQueue *Q,QueueElementType x)
{
if((Q->rear+1)%MAXSIZE==Q->front)
return(FALSE);
Q->element[Q->rear]=x;
Q->rear=(Q->rear+1)%MAXSIZE;
return(TRUE);
}
int DeleteQueue(SeqQueue *Q,QueueElementType *x)
{
if(Q->front==Q->rear)
return(FALSE);
*x=Q->element[Q->front];
Q->front=(Q->front+1)%MAXSIZE;
return(TRUE);
}
int GetHead(SeqQueue Q,QueueElementType *x)
{
*x=Q.element[Q.front];
return(TRUE);
}
void main()
{
int n,i,x;
int temp;
SeqQueue Q;
InitQueue(&Q);
EnterQueue(&Q,1);
for(n=2;n<=10;n++)
{
EnterQueue(&Q,1);
for(i=1;i<=n-2;i++)
{
DeleteQueue(&Q,&temp);
printf("%d",temp);
GetHead(Q,&x);
temp=temp+x;
EnterQueue(&Q,temp);
}
DeleteQueue(&Q,&x);
printf("%d",x);
printf("\n");
EnterQueue(&Q,1);
}
}