

'''simple docstring'''

def  A_	(			snake_case   ,							snake_case			):
  if number < 0 or shift_amount < 0:
    raise ValueError("both inputs must be positive integers"			)

  SCREAMING_SNAKE_CASE:str       =       str(bin(snake_case			)			)
  binary_number += "0" * shift_amount
  return binary_number





def  A_	(			snake_case   ,							snake_case			):
  if number < 0 or shift_amount < 0:
    raise ValueError("both inputs must be positive integers"			)

  SCREAMING_SNAKE_CASE:Any       =       str(bin(snake_case			)			)[2:]
  if shift_amount >= len(snake_case			):
    return "0b0"
  SCREAMING_SNAKE_CASE:Dict       =       binary_number[: len(snake_case			) - shift_amount]
  return "0b" + shifted_binary_number





def  A_	(			snake_case   ,							snake_case			):
  if number >= 0:  # Get binary representation of positive number
    SCREAMING_SNAKE_CASE:List[str]       =       """0""" + str(bin(snake_case			)			).strip("-"			)[2:]
  else:  # Get binary (2's complement) representation of negative number
    SCREAMING_SNAKE_CASE:Any       =       len(bin(snake_case			)[3:]			)  # Find 2's complement of number
    SCREAMING_SNAKE_CASE:str       =       bin(abs(snake_case			) - (1 << binary_number_length)			)[3:]
    SCREAMING_SNAKE_CASE:List[str]       =       (
        """1""" + """0""" * (binary_number_length - len(snake_case			)) + binary_number
    )

  if shift_amount >= len(snake_case			):
    return "0b" + binary_number[0] * len(snake_case			)
  return (
      "0b"
      + binary_number[0] * shift_amount
      + binary_number[: len(snake_case			) - shift_amount]
  )


if __name__ == "__main__":
    import doctest

    doctest.testmod()







"""simple docstring"""



from __future__ import annotations

def  _A(		lowerCAmelCase							):
							if len(lowerCAmelCase							) == 0:
														return []
							A__				,							A__       :     Dict								=			min(lowerCAmelCase							), max(lowerCAmelCase							)
							A__       :     List[Any]								=			int(max_value - min_value							) + 1
							A__       :     list[list]								=			[[] for _ in range(lowerCAmelCase							)]

							for i in my_list:
														buckets[int(i - min_value							)].append(lowerCAmelCase							)

							return [v for bucket in buckets for v in sorted(lowerCAmelCase							)]


if __name__ == "__main__":
				from doctest import testmod

				testmod()
				assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
				assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





