배열을 이용한 BubbleSort

Array/bubbleSort.c

@@ -0,0 +1,52 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#define SIZE    20
+
+int is_duplicate(int arr[], int size, int value);
+
+int main() {
+    int value[SIZE];
+    srand((unsigned)time(NULL));
+
+    printf("정렬 전 [");
+    int count = 0;
+    while(count < SIZE){
+        // 0 ~ 99
+        int num = rand() % 100;
+        if(!is_duplicate(value, count, num)){
+            value[count] = num;
+            printf(" %02d ", value[count]);
+            count++;
+        }
+    }
+    printf("]\n");
+
+    for(int i = 0; i < SIZE - 1; i++){
+        for(int j = 0; j < SIZE - i - 1; j++){
+            if(value[j] > value[j + 1]){
+                int tmp = value[j];
+                value[j] = value[j + 1];
+                value[j + 1] = tmp;
+            }
+        }
+    }
+    
+    printf("정렬 후 [");
+    for(int i = 0; i < SIZE; i++){
+        printf(" %02d ", value[i]);
+    }
+    printf("]\n");
+    
+
+    return 0;
+}
+
+int is_duplicate(int arr[], int size, int value){
+    for(int i = 0; i < size; i++){
+        if(arr[i] == value){ return 1; }
+    }
+
+    return 0;
+}