Sorting

Question

Is the bucket sort is a comparison based sorting algorithm?

Comments

But in bucket sort we create buckets and sort those bucket with insertion sort. Insertion sort is comparison based sort. So I think bucket sort is comparison based sort too.

I dont understand why you use the reason of lower bound

---

For any comparison sort you try you end up with nlogn only that is the best but in bucket , counting , radix you can do it in linear time . . . These sorts does not use comparisons . . . But if there is a case like you told those buckets are of constant time as we consider uniform distribution of keys

---

Ya and also sometimes bucket sort uses recursive calls to itself to sort elements of a particular cell in the bucket.

Answer 1

Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. .

The general implementation of bucket sort can't be called Comparison sort but

.. Bucket sort can be implemented with comparisons and therefore can also be considered a comparison sortalgorithm.

source:wikipedia