分配排序之桶式排序

#include <iostream>

using namespace std;
struct Node
{
    int key;
    int next;
};
struct QueueNode
{
    int front;
    int rear;
};
void Distribute(Node r[],QueueNode q[],int first)
{
    int i=first;
    while(r[i].next!=-1)
    {
        int k=r[i].key;
        if(q[k].front==-1)
            q[k].front=i;
        else
           r[q[k].rear].next=i;
           q[k].rear=i;
           i=r[i].next;
    }
}
void Collect(Node r[],QueueNode q[],int m,int first)
{
    int k=0;
    while(q[k].front!=-1)
        k++;
    first=q[k].front;
    int last=q[k].rear;
    while(k<m)
    {
        k++;
        if(q[k].front!=-1)
        {
            r[last].next=q[k].front;
            last=q[k].rear;
        }
    }
    r[last].next=-1;
}
void Bucket_sort(Node r[],int n,int m,QueueNode q[],int a[])
{
    int i;
    for(i=0;i<n;i++)
    {
        r[i].key=a[i];
        r[i].next=i+1;

    }
    r[n-1].next=-1;
    int first=0;
    for(i=0;i<=m;i++)
        q[i].front=q[i].rear=-1;
    Distribute(r,q,first);
    Collect(r,q,m,first);
}
int main()
{
int n=10,m=10,i=9;
int a[n]={10,9,8,7,6,5,4,3,2,1};
QueueNode q[m+1];
Node r[n];
Bucket_sort(r,n,m,q,a);
do
{
    cout<<r[i].key<<" ";
    i=r[i].next;
}while(r[i].next!=-1);
cout<<endl;
return 0;
}

转载于:https://my.oschina.net/u/3510880/blog/918530