algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

added PigeonHoleSort algorithm

Browse Source
This commit is contained in:
Chris Kolonas
2020-11-25 21:31:27 +02:00
parent 9b8bd417d4
commit 8c928ad565
1 changed files with 27 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
Sorts/PigeonHoleSort.js
View File

@ -6,37 +6,33 @@ https://en.wikipedia.org/wiki/Pigeonhole_sort
* (n) and the length of the range of possible key values (N)
* are approximately the same.
*/
function pigeonhole_sort(arr){
var min = arr[0];
var max = arr[0];
for(let i=0; i<arr.length; i++)
{
if(arr[i] > max)
max = arr[i];
if(arr[i] < min)
min = arr[i];
}
console.log(max);
console.log(min);
var range = max - min + 1;
let pigeonhole = Array(range).fill(0);
for(let i = 0; i<arr.length; i++){
pigeonhole[arr[i] - min]++;
}
let index = 0;
for(let j = 0; j<range; j++){
while(pigeonhole[j]-->0){
arr[index++]=j+min;
}
function pigeonhole_sort (arr) {
let min = arr[0]
let max = arr[0]
for (let i = 0; i < arr.length; i++) {
if (arr[i] > max) { max = arr[i] }
if (arr[i] < min) { min = arr[i] }
}
console.log(max)
console.log(min)
const range = max - min + 1
const pigeonhole = Array(range).fill(0)
for (let i = 0; i < arr.length; i++) {
pigeonhole[arr[i] - min]++
}
let index = 0
for (let j = 0; j < range; j++) {
while (pigeonhole[j]-- > 0) {
arr[index++] = j + min
}
}
}
//Driver code
var arr=Array(8, 3, 2, 7, 4, 6, 8);
pigeonhole_sort(arr);
console.log(arr);
// Driver code
const arr = Array(8, 3, 2, 7, 4, 6, 8)
pigeonhole_sort(arr)
console.log(arr)