forked from huihut/interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBucketSort.cpp
More file actions
80 lines (67 loc) · 1.87 KB
/
BucketSort.cpp
File metadata and controls
80 lines (67 loc) · 1.87 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<iterator>
#include<iostream>
#include<vector>
using std::vector;
/*****************
桶排åºï¼šå°†å€¼ä¸ºiçš„å…ƒç´ æ”¾å…¥iå·æ¡¶ï¼Œæœ€åŽä¾æ¬¡æŠŠæ¡¶é‡Œçš„å…ƒç´ å€’å‡ºæ¥ã€‚
桶排åºåºæ€è·¯ï¼š
1. 设置一个定é‡çš„数组当作空桶å。
2. 寻访åºåˆ—，并且把项目ä
776F
¸€ä¸ªä¸€ä¸ªæ”¾åˆ°å¯¹åº”的桶å去。
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<ListNode*> buckets(BUCKET_NUM,(ListNode*)(0));
for(int i=0;i<n;++i){
int index = arr[i]/BUCKET_NUM;
ListNode *head = buckets.at(index);
buckets.at(index) = insert(head,arr[i]);
}
ListNode *head = buckets.at(0);
for(int i=1;i<BUCKET_NUM;++i){
head = Merge(head,buckets.at(i));
}
for(int i=0;i<n;++i){
arr[i] = head->mData;
head = head->mNext;
}
}