algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 09:28:26 +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

40
Sorts/PigeonHoleSort.js
View File

@ -7,36 +7,32 @@ https://en.wikipedia.org/wiki/Pigeonhole_sort
* are approximately the same. * are approximately the same.
*/ */
function pigeonhole_sort (arr) { function pigeonhole_sort (arr) {
var min = arr[0]; let min = arr[0]
var max = 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);
var range = max - min + 1;
let pigeonhole = Array(range).fill(0);
for (let i = 0; i < arr.length; i++) { for (let i = 0; i < arr.length; i++) {
pigeonhole[arr[i] - min]++; 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; let index = 0
for (let j = 0; j < range; j++) { for (let j = 0; j < range; j++) {
while (pigeonhole[j]-- > 0) { while (pigeonhole[j]-- > 0) {
arr[index++]=j+min; arr[index++] = j + min
} }
} }
} }
// Driver code // Driver code
var arr=Array(8, 3, 2, 7, 4, 6, 8); const arr = Array(8, 3, 2, 7, 4, 6, 8)
pigeonhole_sort(arr); pigeonhole_sort(arr)
console.log(arr); console.log(arr)