バケットソート
1. Bucket sortBucket 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 Ω(n log n) lower bound is inapplicable.
Read “Bucket sort” on English Wikipedia
Read “バケットソート” on Japanese Wikipedia
Read “Bucket sort” on DBpedia
Read “Bucket sort” on English Wikipedia
Read “バケットソート” on Japanese Wikipedia
Read “Bucket sort” on DBpedia
Discussions
Log in to talk about this word.