#include
#include
#include
using std::vector;
/*****************
桶排åºï¼šå°†å€¼ä¸ºiçš„å…ƒç´ æ”¾å…¥iå·æ¡¶ï¼Œæœ€åŽä¾æ¬¡æŠŠæ¡¶é‡Œçš„å…ƒç´ å€’å‡ºæ¥ã€‚
桶排åºåºæ€è·¯ï¼š
1. 设置一个定é‡çš„数组当作空桶å。
2. 寻访åºåˆ—，并且把项目一个一个放到对应的桶å去。
3. 对æ¯ä¸ªä¸æ˜¯ç©ºçš„桶å进行排åºã€‚
4. 从ä¸æ˜¯ç©ºçš„桶å里把项目å†æ”¾å›žåŽŸæ¥çš„åºåˆ—ä¸ã€‚
å‡è®¾æ•°æ®åˆ†å¸ƒåœ¨[0，100)之间，æ¯ä¸ªæ¡¶å†…部用链表表示，在数æ®å…¥æ¡¶çš„åŒæ—¶æ’入排åºï¼Œç„¶åŽæŠŠå„个桶ä¸çš„æ•°æ®åˆå¹¶ã€‚
*****************/
const int BUCKET_NUM = 10;
struct ListNode{
explicit ListNode(int i=0):mData(i),mNext(NULL){}
ListNode* mNext;
int mData;
};
ListNode* insert(ListNode* head,int val){
ListNode dummyNode;
ListNode *newNode = new ListNode(val);
ListNode *pre,*curr;
dummyNode.mNext = head;
pre = &dummyNode;
curr = head;
while(NULL!=curr && curr->mData<=val){
pre = curr;
curr = curr->mNext;
}
newNode->mNext = curr;
pre->mNext = newNode;
return dummyNode.mNext;
}
ListNode* Merge(ListNode *head1,ListNode *head2){
ListNode dummyNode;
ListNode *dummy = &dummyNode;
while(NULL!=head1 && NULL!=head2){
if(head1->mData <= head2->mData){
dummy->mNext = head1;
head1 = head1->mNext;
}else{
dummy->mNext = head2;
head2 = head2->mNext;
}
dummy = dummy->mNext;
}
if(NULL!=head1) dummy->mNext = head1;
if(NULL!=head2) dummy->mNext = head2;
return dummyNode.mNext;
}
void BucketSort(int n,int arr[]){
vector buckets(BUCKET_NUM,(ListNode*)(0));
for(int i=0;imData;
head = head->mNext;
}
}