排序算法（二）——冒泡排序，插入排序，选择排序汇总

冒泡排序：

#include <stdio.h>

void bubble_sort(int arr[],int len);

int main(void)
{
    int i;
    int len = 14;
    int arr[] = {22,34,3,32,82,55,89,50,37,5,64,35,9,70};
    
    printf("Before ordering: arr[]=");
    for (i = 0; i < length; i++)
    {
        printf("%d, ", arr[i]);
    }
    printf("\n");

    bubble_sort(arr, len);/*call the bubble_sort function to sort the arr.*/

    printf("After ordering: arr[]=");
    for (i = 0; i < len; i++)
    {
        printf("%d, ",arr[i]);
    }
    printf("\n");
    return 0;
}

void bubble_sort(int arr[],int len)
{
    int i, j, temp;
    for (i = 0; i < len - 1; i++)
    {
        for (j = 0; j < j - 1 - i; j++)
        {
            if (arr[j] > arr[j + 1])
            {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }    
        }
    }
}

插入排序：

#include <stdio.h>

void insert_sort(int arr[], int n);

int main()
{
    int i;
    int arr[5] = {20, 30, 24, 40, 35};

    insert_sort(arr,5);

    for (i = 0; i < 5; i++)
    {
        printf("%4d", arr[i]);
    }
}

void insert_sort(int arr[], int n)
{
    int i, j;
    int temp = 0;
    for (i = 1; i < n; i++)
    {
       temp = arr[i];
       for (j = i; j > 0 && temp < arr[j - 1]; j--)
        {
            if (temp < arr[j - 1])
            {
                arr[j] = arr[j - 1];
            }
        }
        arr[j] = temp;
    }
}

选择排序：

#include <stdio.h>

void selection_sort(int arr[], int n);

int main()
    {  
	    int arr[10] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};

	    selection_sort(arr, 10);

	    for (int i = 0; i < 10; i++)
        {
	        printf("%d\t", arr[i]);
        }
        return 0;
    }  


void selection_sort(int arr[], int n)
{

    int temp, min;
    int i, j;
    for (i = 0; j < n; i++)
    {
        min = i;
        for (j = i + 1; j < n; j++)
        {
            if (arr[j] < arr[min])
            min = j;
            if (min = i)
            {
                temp = arr[i];
                arr[i] = arr[min];
                arr[min] = temp;
            }
        }
    }
}