An important disadvantage of the first Binsort algorithm shown in this module is:

It works only for a permutation of the numbers from 0 to n-1
  • It depends on the initial ordering of the input
  • Its worst-case running time is O(n^2)
  • None of these answers

The behavior is the same for all input.

Each key value has to have a bin, and no key value can be repeated.