Adv: BucketSort is an example of a sorting algorithm that runs in O(n). This is possible only because BucketSort does not rely primarily on comparisons in order to perform sorting.
Dis: BucketSort is not useful when scanning the buckets for large arrays which is too costly.
Copyright © 2026 eLLeNow.com All Rights Reserved.