排序算法

#include <stdio.h>

void bubble(int arr[], int length);
void selectionSort (int arr[], int length);

int main (void)
{
    int arr[12] = {100, 23, 32, 1, 392, 13, 513, 123, 19, 251, 1, 52};

    selectionSort(arr, 12);

    int i;
    for(i = 0; i < 12; i++)
    {
        printf("%d: %d\n", i, arr[i]);
    }
}
void bubble(int arr[], int length)
{
    int i, j;
    for(i = 0; i < length - 1; i++)
    {
        for(j = 0; j < length - 1 - i; j++)
        {
            if(arr[j] > arr[j + 1])
            {
                int temp;
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}
void selectionSort (int arr[], int length)
{
    int i, j;
    for(i = 0; i < length - 1; i++)
    {
        for(j = i + 1; j < length; j++)
        {
            if(arr[i] > arr[j])
            {
                int temp;
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}