一个时间效率为O(n)的排序算法

题目：请实现一个排序算法，要求时间效率为O(n).(允许使用常量大小的辅助空间不得超过O（n）)

首先回顾一下自己实现了的几种常用的排序算法

一、插入排序：

#include<iostream>
using namespace std;
void Insert_sort(int A[], int size)
{
    for (int j = 1; j < size; j++)
    {
        int key = A[j];
        int i = j - 1;
        while (i >= 0 && A[i] > key)
        {
            A[i + 1] = A[i];
            i--;
        }
        A[i + 1] = key;
    }
}
void print_Insert(int A[],int size)
{
    for (int i = 0; i < size; i++)
    {
        cout << A[i] << "    ";
    }
    cout << endl;
}
int main2()
{
    int A[10] = { 3, 2, 5, 7, 9, 4, 6, 3, 8, 10 };
    Insert_sort(A, 10);
    print_Insert(A, 10);
    system("pause");
    return 0;
}

 二、快速排序

#include<iostream>
using namespace std;
void Exchange(int &a, int &b)
{
    int temp = a;
    a = b;
    b = temp;
}
int Partion(int A[], int p, int r)
{
    int x = A[r];
    int i = p - 1;
    for (int j = p; j < r; j++)
    {
        if (A[j] <= x)
        {
            i++;
            Exchange(A[i], A[j]);
        }
    }
    Exchange(A[i + 1], A[r]);
    return i + 1;
}
void Quick_sort(int A[], int p, int r)
{
    if (p < r){
        int q = Partion(A, p, r);
        Quick_sort(A, p, q - 1);
        Quick_sort(A, q + 1, r);
    }
}
void print_Quick(int A[], int size)
{
    for (int i = 0; i < size; i++)
    {
        cout << A[i] << "    ";
    }
    cout << endl;
}
int main()
{
    int A[10] = { 3, 2, 5, 7, 9, 4, 6, 3, 8, 10 };
    Quick_sort(A, 0, 9);
    print_Quick(A, 10);
    system("pause");
    return 0;
}

 

三、归并排序

#include<iostream>
using namespace std;
void Merge(int A[], int p, int q, int r)
{
    int n1 = q - p + 1;
    int n2 = r - q;
    int L[100] = { 0 };
    int R[100] = { 0 };
    for (int i = 0; i < n1; i++)
    {
        L[i] = A[p + i];
    }
    for (int i = 0; i < n2; i++)
    {
        R[i] = A[q + i + 1];
    }
    L[n1] = INT_MAX;
    R[n2] = INT_MAX;
    int i = 0;
    int j = 0;
    for (int k = p; k <=r; k++){
        if (L[i] < R[j]){
            A[k] = L[i];
            ++i;
        }
        else{
            A[k] = R[j];
            ++j;
        }
    }
}
void Merge_sort(int A[], int p, int r)
{
    if (p < r)
    {
        int q = (p+r) / 2;
        Merge_sort(A, p, q);
        Merge_sort(A, q + 1, r);
        Merge(A, p, q, r);
    }
}
void print_Merge(int A[], int size)
{
    for (int i = 0; i < size; i++)
    {
        cout << A[i] << "    ";
    }
    cout << endl;
}
int main()
{
    int A[10] = { 3, 2, 5, 7, 9, 4, 6, 3, 8, 10 };
    Merge_sort(A, 0,9);
    print_Merge(A, 10);
    system("pause");
    return 0;
}

 

四、堆排序

#include<iostream>
#include<vector>
using namespace std;
void Exchange(int &a, int &b)
{
    int temp = a;
    a = b;
    b = temp;
}
void Max_Heapify(vector<int> &A, int i, int size)
{
    int  l = 2 * i;
    int r = 2 * i + 1;
    int largest;
    if (l <= size&& A[l]>A[i])
        largest = l;
    else
        largest = i;
    if (r <= size && A[r]>A[largest])
        largest = r;
    if (largest != i){
        Exchange(A[i], A[largest]);
        Max_Heapify(A, largest, size);
    }
}
void Build_MaxHeap(vector<int> &A, int size)
{
    for (int i = size / 2; i >= 1; --i)
    {
        Max_Heapify(A, i, size);
    }
}
void Heap_Sort(vector<int> &A, int size)
{
    Build_MaxHeap(A, size);
    for (int i = size; i >= 1; --i)
    {
        Exchange(A[1], A[i]);
        Max_Heapify(A, 1, i - 1);
    }
}
void print(vector<int> A, int size)
{
    for (int i = 1; i <= size; i++)
    {
        cout << A[i] << " ";
    }
    cout << endl;
}

int main()
{
        vector<int> A(100);
        int size;
        cout << "please input the size" << endl;
        cin >> size;
        cout << "please input the number" << endl;
        for (int i = 1; i <= size; i++)
        {
                cin >> A[i];
        }
        print(A,size);
        Build_MaxHeap(A,size);
        print(A,size);
        Heap_Sort(A, size);
        print(A, size);
        system("pause");
        return 0;
}                                                

 

五、计数排序

#include<iostream>
using namespace std;
void Counting_sort(int A[], int last, int B[], int k)
{
    int C[100] = { 0 };
    for (int j = 1; j <= last; j++)
    {
        C[A[j]] = C[A[j]] + 1;
    }
    for (int i = 1; i <= k; i++)
    {
        C[i] = C[i] + C[i - 1];
    }
    for (int j = last; j >= 1; j--)
    {
        B[C[A[j]]] = A[j];
        C[A[j]] = C[A[j]] - 1;
    }
}
void print_count(int A[], int last)
{
    for (int i = 1; i <= last; i++)
    {
        cout << A[i] << "    ";
    }
    cout << endl;
}
int main()
{
    int A[9] = { 0, 2, 5, 3, 0, 2, 3, 0, 3 };
    int B[9] = { 0 };
    Counting_sort(A, 8, B, 5);
    print_count(B, 8);
    system("pause");
    return 0;
}

 

 

对于上述问题的理解：就是要对员工按照年龄来进行排序，显然年龄是一个较小的范围可以让我们用来做为常数级别的空间来存放，每个年龄段的人，然后根据年龄排序即可，故可以写出如下的代码：

#include<iostream>
using namespace std;
void ages_sort(int age[], int length)
{
    if (age == nullptr || length <= 0)
        return;
    const int largest_ages = 100;
    int TimeOfAge[largest_ages+1] = { 0 };
    for (int i = 1; i <= length; ++i)
    {
        if (age[i] < 0 || age[i]>100)
            throw exception("out of age");
        ++TimeOfAge[age[i]];
    }
    int index=0;
    for (int i = 0; i <= largest_ages; ++i)
    {
        for (int j = 0; j < TimeOfAge[i]; ++j)
        {
            age[index] = i;
            ++index;
        }
    }
}