[Cpp]
Void Insert_sort_Swap_Node (EleLink * old_froMax_Node, EleLink * old_Max_Node, EleLink * froMax_Node, elelelink * Max_Node)
{
EleLink * tmp = Max_Node-> pnext;
If (old_Max_Node-> pnext = Max_Node)
{
Old_froMax_Node-> pnext = Max_Node;
Max_Node-> pnext = old_Max_Node;
Old_Max_Node-> pnext = tmp;
}
Else
{
Old_froMax_Node-> pnext = Max_Node;
Max_Node-> pnext = old_Max_Node-> pnext;
FroMax_Node-> pnext = old_Max_Node;
Old_Max_Node-> pnext = tmp;
}
}
Void Link_Insert_Sort (EleLink * pNode)
{
If (! PNode |! PNode-> pnext)
Return;
EleLink * p = pNode-> pnext;
Int ncount = 0;
While (p)
{
Ncount ++;
P = p-> pnext;
}
P = pNode;
EleLink * fro_Node, * froMax_Node;
EleLink * cur_Node, * Max_Node;
For (int I = 0; I <ncount-1; I ++)
{
FroMax_Node = p;
Max_Node = p-> pnext;
Fro_Node = p-> pnext;
Cur_Node = fro_Node-> pnext;
While (cur_Node)
{
If (Max_Node-> Value> cur_Node-> Value)
{
FroMax_Node = fro_Node;
Max_Node = cur_Node;
}
Fro_Node = cur_Node;
Cur_Node = cur_Node-> pnext;
}
If (Max_Node! = P-> pnext)
Insert_sort_Swap_Node (p, p-> pnext, froMax_Node, Max_Node );
P = p-> pnext;
}
}
Void Bucket_Sort (int * a, int size, EleLink ** bucket, int ncnt)
{
For (int I = 0; I <size; I ++)
{
Int temp = a [I]/10;
EleLink * p_Ele = new EleLink;
P_Ele-> pnext = NULL;
P_Ele-> Value = a [I];
EleLink * ptr = bucket [temp];
EleLink * p_tmp = ptr-> pnext;
Ptr-> pnext = p_Ele;
P_Ele-> pnext = p_tmp;
}
Int m = 0;
For (int j = 0; j <ncnt; j ++)
{
Link_Insert_Sort (bucket [j]);
EleLink * ptr = bucket [j]-> pnext;
While (ptr)
{
A [m ++] = ptr-> Value;
Ptr = ptr-> pnext;
}
}
Assert (m = size );
}
Author: wchm_seu