簡單排序

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

//count用來記錄次數
int  count1 = 0;
int count2 = 0;
int count3 = 0;
int count4 = 0;

void Show(int *arr,int len)
{
    for (int i = 0; i < len; i++)
    {
        printf("%d ",arr[i]);
    }
    printf("\n");
}

void Swap(int *x,int *y)
{
    int temp=0;
    temp = *x;
    *x = *y;
    *y = temp;
}

//下面算法均是從小到大排序

// 冒泡排序

void BubbleSort(int *arr,int len)
{
    if (arr == NULL)return;
    for (int i = 0; i < len - 1; i++)
    {
        for (int j = 0; j < len - 1 - i; j++)
        {
            if (arr[j] > arr[j + 1])
            {
                count1++;
                Swap(&arr[j],&arr[j+1]);
            }
        }
    }
}

//改進版冒泡排序 加上標誌位  當數組中的元素越有序這個越高效

void BubbleEx(int *arr, int len)
{
    if (arr == NULL) return;
    int tag = 0;
    for (int i = 0; i < len-1; i++)
    {
        tag = 0;
        for (int j = 0; j < len - 1 - i; j++)
        {
            count2++;
            if (arr[j] > arr[j + 1])
            {
                tag = 1;
                Swap(&arr[j], &arr[j + 1]);
            }
        }
        if (tag == 0)
        {
            break;
        }
    }

}

//交換排序
void ExchangeSort(int *arr, int len)
{
    if (arr == NULL) return;
    for (int i = 0; i < len-1; i++)
    {
        for (int j = i + 1; j < len; j++)
        {
            count3++;
            if (arr[i] > arr[j])
            {
                Swap(&arr[i],&arr[j]);
            }
        }
    }
}



//選擇排序

void ChoiceSort(int *arr, int len)
{
    if (arr == NULL) return;
    for (int i = 0; i < len - 1; i++)
    {
        int min = i;
        for (int j = i + 1; j < len; j++)
        {
            count4++;
            if (arr[min] > arr[j])
            {
                min=j;
            }
        }
        if (i != min)
        {
            Swap(&arr[i],&arr[min]);
        }
    }

}
int main()
{
    int arr1[] = {11,3,15,10,7,2,44,1,0};
    int n1 = sizeof(arr1) / sizeof(sizeof(arr1[0]));

    printf("冒泡排序：\n");
    BubbleSort(arr1,n1);
    Show(arr1, n1);
    printf("循環次數：%d\n",count1);

    int arr2[] = { 11, 3, 15, 10, 7, 2, 44, 1, 0 };
    int n2 = sizeof(arr2) / sizeof(sizeof(arr2[0]));

    printf("冒泡排序改進：\n");
    BubbleEx(arr2,n2);
    Show(arr2, n2);
    printf("循環次數：%d\n", count2);


    int arr3[] = { 11, 3, 15, 10, 7, 2, 44, 1, 0 };
    int n3 = sizeof(arr3) / sizeof(sizeof(arr3[0]));

    printf("交換排序：\n");
    ExchangeSort(arr3,n3);
    Show(arr3, n3);
    printf("循環次數：%d\n", count3);

    int arr4[] = { 11, 3, 15, 10, 7, 2, 44, 1, 0 };
    int n4 = sizeof(arr4) / sizeof(sizeof(arr4[0]));

    printf("選擇排序：\n");
    ChoiceSort(arr4, n4);
    Show(arr4, n4);
    printf("循環次數：%d\n", count4);
}