/
pigeonhole sort.cpp
52 lines (43 loc) · 1.06 KB
/
pigeonhole sort.cpp
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
#include <iostream>
#include <vector>
#include <algorithm>
void pigeonholeSort(std::vector<int>& arr) {
int min = arr[0], max = arr[0];
for (int i = 1; i < arr.size(); i++) {
if (arr[i] < min) {
min = arr[i];
}
if (arr[i] > max) {
max = arr[i];
}
}
int range = max - min + 1;
std::vector<int> pigeonholes(range, 0);
for (int i = 0; i < arr.size(); i++) {
pigeonholes[arr[i] - min]++;
}
int index = 0;
for (int i = 0; i < range; i++) {
while (pigeonholes[i] > 0) {
arr[index++] = i + min;
pigeonholes[i]--;
}
}
}
int main() {
int n;
std::cout << "Enter the number of elements: ";
std::cin >> n;
std::vector<int> arr(n);
std::cout << "Enter the elements:" << std::endl;
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
}
pigeonholeSort(arr);
std::cout << "Sorted array: ";
for (int i = 0; i < n; i++) {
std::cout << arr[i] << " ";
}
std::cout << std::endl;
return 0;
}