title: Bucket sort:Why don't we set range to 1? vs counting sort
body: <p>Bucket sort creates k buckets....and distribute n numbers in one of those buckets..
  Eg.1-10, 
  11-20,
  21-30...
  O(n+k)</p>
  
  <p>The no.s within the bucket are sorted using insertion O(n²)</p>
  
  <p>It works fine when few numbers end up in same bucket.. O(n+k)
  But if all numbers end up in same bucket ...O(n²)</p>
  
  <p>My question is if we make range of buckets as 1 ie 0-1
  ,1-2,
  2-3.....
  Different no.s won't end up in same bucket....(no sorting within bucket required)
  O(n+k)</p>
  
  <p>Without concerning space complexity why don't we use this instead of counting sort?
  Plzz correct me if I m wrong..</p>