Bubble Sort

Author: SeongHo5356

Bubble_Sort.cpp

@@ -19,6 +19,10 @@ int main(void){
 				array[j+1] = temp;
 			}
 		}
+		for(int m =0; m<10;m++){
+			printf("%d ", array[m]);
+		}
+		printf("\n");
 	}
 
      //정렬 후 리스트의 모습

Bubble_Sort.exe

@@ -0,0 +1,31 @@
+#include<stdio.h>
+
+int array[1001];
+
+int main(void){
+	int number, temp;
+	scanf("%d", &number);
+	for(int i =0; i < number; i++){
+		scanf("%d",&array[i]);
+	}
+	
+	for(int i =0;i < number; i++){
+		for(int k=0; k< number-1-i;k++){
+			if(array[k] > array[k+1]){
+				temp = array[k];
+				array[k] = array[k+1];
+				array[k+1]= temp;
+			}
+		}
+		for(int m =0; m<number; m++){
+			printf("%d ", array[m]);
+		}
+		printf("\n");
+	}
+	
+	for(int i =0; i<number; i++){
+		printf("%d ", array[i]);
+	}
+
+	return 0;
+}

Bubble_scanf.cpp

@@ -0,0 +1,28 @@
+#include<stdio.h>
+
+int array[1001];
+
+int main(void){
+	int number, temp;
+	scanf("%d", &number);
+	for(int i =0; i < number; i++){
+		scanf("%d",&array[i]);
+	}
+	
+	for(int i=0;i<number-1;i++){
+		int j = i;
+		while(j>=0 && array[j]>=array[j+1]){
+			temp = array[j];
+			array[j]= array[j+1];
+			array[j+1] = temp;
+			j--;
+		}
+		for(int k=0;k<number;k++){
+			printf("%d ", array[k]);
+		}
+		printf("\n");
+	}
+	
+	
+	return 0;
+}

Insertion_scanf.cpp

@@ -0,0 +1,31 @@
+#include <stdio.h>
+int array[1001];
+
+int main(void){
+	int index,number, temp;
+	scanf("%d", &number);
+	for(int i =0; i<number; i++){
+		scanf("%d", &array[i]);
+	}	
+	
+	for(int i =0;i<number;i++){
+		index = i; 
+		for(int k = i+1 ; k < number; k++ ){
+			if(array[i] > array[k]){
+				index = k;
+				printf("index changed to %d\n", index);
+			}
+		}
+		if(index != i){
+			printf("index is %d, i is %d\n", index, i);
+			temp = array[i];
+			array[i] = array[index];
+			array[index] = temp;
+		}
+		for(int m=0;m<number;m++){
+			printf("%d ", array[m]);
+		}
+		printf("\n");
+	}
+	return 0;
+}