冒泡排序

#include <stdio.h>

void bubbleAlgorithmSort(int array[], int arrayCount);
int main(int argc, const char * argv[]) {
    
    int array[] = {1,3,2,0,5};
    int arrayCount = sizeof(array) / sizeof(int);
    
    bubbleAlgorithmSort(array, arrayCount);
    for (int i = 0; i < arrayCount; i++)
    {
        printf("%d ",array[i]);
    }
    
    return 0;
}

void bubbleAlgorithmSort(int *array, int arrayCount)
{
    for (int i = 0; i < arrayCount; i++)
    {
        for (int j = 0; j < arrayCount - i - 1; j++)
        {
            if (array[j] > array[j+1])
            {
                int temp = array[j+1];
                array[j+1] = array[j];
                array[j] = temp;
            }
        }
    }
}