#include <stdio.h>
#include<string.h>
#define x 100
int front=-1,rear=-1;
int queue[x];
void enqueue(int data)
{
if (rear==x-1)
{
printf("\n연산 안됨\n");
}
else
{
rear++;
queue[rear]=data;
}
}
int dequeue()
{
int tmp;
if(front>rear)
{
printf("\n연산 안됨\n");
}
else
{
front++;
tmp = queue[front];
queue[front] = 0;
printf("result : %d \n",tmp);
}
}
void view()
{
int i;
printf("=============\n\n");
for(i=front+1;i<=rear;i++)
{
printf("%d ",queue[i]);
}
printf("\n\n=============\n");
}
int main()
{
int a,i,num;
while(1)
{
printf("1: 숫자 입력 2: 삭제 3: 배열 보기\n ");
scanf("%d",&a);
if(a==1)
{
printf("\n입력할 숫자:");
scanf("%d",&num);
enqueue(num);
view();
}
else if(a==2)
{
dequeue();
}
else if(a==3)
{
view();
}
}
}
#include <stdio.h>
#include<string.h>
#define x 1000
int front=0,rear=0;
int queue[x];
int isFull()
{
if((rear+1)%x==front)
{
return 0;
}
else
return 1;
}
int isEmpty()
{
if(front==rear)
{
return 0;
}
else
return 1;
}
void enqueue(int data)
{
if(isFull())
{
rear=(rear+1)%x;
queue[rear]=data;
}
else
{
printf("\n Full\n");
}
}
void dequeue()
{
int hhh;
if(isEmpty())
{
front = (front+1)%x;
hhh = queue[front];
queue[front] = 0;
printf("result : %d \n",hhh);
}
else
{
printf("\n Empty\n");
}
}
void view()
{
int i;
printf("=============\n\n");
if(front<rear)
{
for(i=front+1; i<=rear; i++)
{
printf("%d ",queue[i]);
}
}
else if(front>rear)
{
for(i=front+1; i<x; i++)
{
printf("%d ",queue[i]);
}
for(i=0; i<=rear; i++)
{
printf("%d ",queue[i]);
}
}
else
{
printf("no data");
}
printf("\n\nf = %d, r = %d",front, rear);
printf("\n=============\n");
}
int main()
{
int a,i,num;
while(1)
{
printf("1: 숫자 입력하기 2: 삭제하기 3: 배열 보기\n ");
scanf("%d",&a);
if(a==1)
{
printf("\n입력할 숫자:");
scanf("%d",&num);
enqueue(num);
view();
}
else if(a==2)
{
dequeue();
view();
}
else if(a==3)
{
view();
}
}
}
#include <stdio.h>
int a[10001];
int n, i, j, temp;
int main()
{
scanf("%d", &n);
for (i=1; i<=n; i++)
{
scanf("%d", &a[i]);
}
for(i=1; i<n; i++)
{
for(j=0;j<=n-i;j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for (i = 1; i <= n; i++)
{
printf("%d\n", a[i]);
}
return 0;
} //오름차순배열
#include<stdio.h>
int main()
{
int n,i,j,k,arr[1001]= {0},sum,num=0,hhh=0;
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&arr[i]);
}
for(i=1; i<n; i++)
{
for(j=0; j<n-1; j++)
{
if(arr[j]>arr[j+1])
{
sum = arr[j];
arr[j] = arr[j+1];
arr[j+1] = sum;
}
}
}
for(i=0; i<n; i++)
{
printf("%d ",arr[i]);
}
printf("%d",hhh);
}