Bucket sort is stable, if the underlying sort is also stable, as equal keys are inserted in order to each bucket. Counting sort works by determining how many integers are behind each integer in the input array A.

Why is bucket sort bad?

Here are a few disadvantages of bucket sort: As mentioned above, you can't apply it to all data types because you need a good bucketing scheme. Bucket sort's efficiency is sensitive to the distribution of the input values, so if you have tightly-clustered values, it's not worth it.

Which sorting method is stable?

Explanation: Out of the given options binary insertion sort is the only algorithm which is stable. It is because the elements with identical values appear in the same order in the output array as they were in the input array.