Code/Resource
Windows Develop
Linux-Unix program
Internet-Socket-Network
Web Server
Browser Client
Ftp Server
Ftp Client
Browser Plugins
Proxy Server
Email Server
Email Client
WEB Mail
Firewall-Security
Telnet Server
Telnet Client
ICQ-IM-Chat
Search Engine
Sniffer Package capture
Remote Control
xml-soap-webservice
P2P
WEB(ASP,PHP,...)
TCP/IP Stack
SNMP
Grid Computing
SilverLight
DNS
Cluster Service
Network Security
Communication-Mobile
Game Program
Editor
Multimedia program
Graph program
Compiler program
Compress-Decompress algrithms
Crypt_Decrypt algrithms
Mathimatics-Numerical algorithms
MultiLanguage
Disk/Storage
Java Develop
assembly language
Applications
Other systems
Database system
Embeded-SCM Develop
FlashMX/Flex
source in ebook
Delphi VCL
OS Develop
MiddleWare
MPI
MacOS develop
LabView
ELanguage
Software/Tools
E-Books
Artical/Document
queue.c
Package: C语言精彩编程百例_源代码.rar [view]
Upload User: bjtelijie
Upload Date: 2010-01-01
Package Size: 87k
Code Size: 1k
Category:
Algorithm
Development Platform:
Visual C++
- #include <stdio.h>
- #define Max 100
- void SetNull(front, rear)
- int *front, *rear;
- {
- *front = 0;
- *rear = 0;
- }
- int Empty(front,rear)
- int *front, *rear;
- {
- if(*front == *rear)
- return(1);
- else
- return(0);
- }
- int EnQueue(q,x,front,rear)
- int q[];
- int x;
- int *front,*rear;
- {
- *rear = (*rear+1) % Max;
- if(*front == *rear)
- {
- printf("队列发生上溢n");
- return(-1);
- }
- else
- {
- q[*rear] = x;
- return(0);
- }
- }
- int DelQueue(q,y,front,rear)
- int q[];
- int *y;
- int *front,*rear;
- {
- *front = (*front +1)%Max;
- if(*front == *rear)
- {
- printf("队列发生下溢n");
- return(-1);
- }
- else
- {
- *y = q[*front];
- return(0);
- }
- }
- void main()
- {
- int q[Max];
- int f = 0, r = 0; /*f和r分别对应队列的头和尾在整个队列存储区域的位置*/
- int i,x,m,n;
- int a;
- SetNull(&f,&r); /*清空队列*/
- printf("要输入队列的字符个数:n");
- scanf("%d",&m);
- printf("输入队列的整型数据:n");
- for (i=0; i<m; i++)
- {
- i=i;
- scanf("%d",&x);
- a = EnQueue(q,x,&f,&r);
- if(a == -1)
- break;
- }
- printf("要提出队列的字符个数:");
- scanf("%d",&n);
- printf("输出从队列中提取的数据:n");
- for (i = 0; i<n; i++)
- {
- if(DelQueue(q,&x,&f,&r) == -1)
- break;
- printf("%dn",x);
- }
- if(Empty(&f,&r) == 1)
- printf("队列为空");
- else
- printf("队列中还有%d个数据",(m-n));
- }