Sorting-Algorithm 排序算法

Bubble Sort

/* Bubble Sort */
#include <iostream>
using namespace std;
#define LEN 10
void bubbleSort(int *);
int main()
{
    int arr[LEN];
    for (int i = 0; i < LEN; i++)
        cin >> arr[i];
    bubbleSort(arr);
    for (int i = 0; i < LEN; i++)
        cout << arr[i] << " ";
    return 0;
}

void bubbleSort(int * arr)
{
    for (int i = 0; i < LEN; i++)
        for (int j = 0; j < LEN - 1; j++) {
            if (arr[j] > arr[j + 1])
            {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
}

Select Sort

/* select sort */
#include <iostream>
using namespace std;
#define LEN 10
void selectSort(int *);
int main()
{
    int arr[LEN];
    for (int i = 0; i < LEN; i++)
        cin >> arr[i];
    selectSort(arr);
    for (int i = 0; i < LEN; i++)
        cout << arr[i] << " ";
    return 0;
}

void selectSort (int * arr)
{
    for (int i = 0; i < LEN - 1; i++)
    {
        int min = arr[i];
        int min_sub = i;
        for (int j = i + 1; j < LEN; j++)
        {
            if (arr[j] < min)
            {
                min = arr[j];
                min_sub = j;
            }
        }
        arr[min_sub] = arr[i];
        arr[i] = min;
    }
}

Insert Sort

/* Insert Sort */
#include <iostream>
using namespace std;
#define LEN 10
void InsertSort(int *, int);
int main()
{
    int arr[LEN];
    for (int i = 0; i < LEN; i++)
        cin >> arr[i];
    InsertSort(arr, LEN);
    for (int i = 0; i < LEN; i++)
        cout << arr[i] << " ";
    return 0;
}

void InsertSort(int * arr, int length)
{
    for (int i = 0; i < length; i++)
    {
        if (arr[i + 1] < arr[i])
        { 
            int temp = arr[i];
            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
        }
        InsertSort(arr, i);
    }
}