20221019

/* if () { rear+=2; } #include<stdio.h> #define SIZE 5 int queue[SIZE]= {}; int rear=0, front=0,i; void enqueue(int m) { if ((rear+1)%SIZE == front) { printf("queue is a full.\n"); return ; } else { rear=(rear+1)%SIZE;//rear++; queue[rear] = m; printf("%d QUEUE okay\n",m); view(); } } void dequeue() { if (front == rear) { printf("rear == front ! empty!"); } else { front = (front+1)%5; //front++; printf("%d dequeue okay.\n",queue[front]); queue[front]=0; view(); } } void view() { for (int i=0; i<5; i++) { printf("QUENE[%d] >> %d ",i,queue[i]); if(i==front) printf(" front"); if(i==rear) printf(" rear"); printf("\n"); } } int main() { int i,j,k,n,m,q=1; while(q) { printf("\n1.ENQUEUE 2.DEQUEUE 3.VIEW 4.EXIT : "); scanf("%d",&n); if (n == 1) { printf("DATA : "); scanf("%d",&m); enqueue(m); } if (n == 2) { dequeue(); } if (n == 3) { view(); } if (n == 4) { q=0; } } } sort 정렬 5 1 4 2 3 -> 1 2 3 4 5(오름차순) or 5 4 3 2 1(내림차순) 1. easy but slow : 버블, 선택, 삽입 2. hard but fast : 퀵, 기수, 병합, 힙, .... 입력 데이터가 어떤지? 정렬 기법을 선택 1. buble sort : 고르게 느려 , but 코드가 soso easy , 외우기 쉽다. 인접한 두 원소를 비교하면서 정렬해나감 #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 = 1; 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 i,j,k,n,m; int arr[1000]={}; scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%d",&arr[i]); } for (i = 1 ;i <= n;i++) { for (j = 1 ;j <= n-i ;j++) { if (arr[j] > arr[j+1]) { k = arr[j]; arr[j] = arr[j+1]; arr[j+1] = k; } } } for (i=n;i>=1;i--) { printf("%d\n",arr[i]); } } */ #include<stdio.h> int main() { int i,j,k,n,m; int arr[1001]={}; scanf("%d",&n); for (i=1 ; i<=n ; i++) { scanf("%d",&arr[i]); } for (i=1;i<=n;i++) { m=0; for (j=1;j<=n-i;j++) { if (arr[j] > arr[j+1]) { k = arr[j]; arr[j] = arr[j+1]; arr[j+1] = k; m++; } } if(m==0){ printf("%d",i-1); break; } } }