Bubble sort(버블소트)

Bubble sort(버블소트) 시간복잡도: Best = Average = Worst = O(n^2)

#include <stdio.h>
#include <stdlib.h>

void bubbleSort(int* arr, int size)
{
	int temp;
    int i, j;
    
    for ( i = size-1; i > 0; i-- ){
    	for ( j = 0; j < i; j++ ){
        	if ( arr[j] > arr[j+1] ){
            	temp = arr[j+1];
                arr[j+1] = arr[j];
                arr[j] = temp;
            }
        }
    }
}
int maind()
{
	int size;
    int *arr;
    int i;
    
    scanf("%d", &size);
    arr = (int *)malloc(sizeof(int)*size);
    
    for ( i = 0; i < size; i ++ )
    	scanf("%d", &arr[i]);
        
    bubbleSort(arr, size);
}