出典:Wiktionary
出典:『Wiktionary』 (2026/07/16 23:14 UTC 版)
bucket sort (plural bucket sorts)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/29 18:46 UTC 版)
Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Since bucket sort is not a comparison sort, the O(n log n) lower bound is inapplicable. The computational complexity estimates involve the number of buckets.
| ・Bucket sort | |
| ・Aleck | |
| ・ILINCK | |
| ・deedlit | |
| ・abpx | |
| ・MEECN | |
| ・Espanha | |
| ・TRUMPET | |
| ・To enter data | |
| ・nickelization |