Pigeonhole sort
id:
pigeonhole-sort-186-5540377
title:
Pigeonhole sort
text:
Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of possible key values are approximately the same. It requires O(n + N) time. It is similar to counting sort, but differs in that it "moves items twice: once to the bucket array and again to the final destination [whereas] counting sort builds an auxiliary array then uses the array to compute each item's final destination and move the item there."
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Pigeonhole_sort
date created:
2001-11-21T16:41:53Z
date modified:
2024-09-07T22:37:45Z
main entity:
{"identifier":"Q3235843","url":"https://www.wikidata.org/entity/Q3235843"}
image:
fields total:
13
integrity:
14