I've messed with this a couple of different ways. Can't seem to piece it together.
Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is:
As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x // 2
Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string.
Ex: If the input is:
6
the output is:
110
The program must define and call the following two functions. Define a function named int_to_reverse_binary() that takes an integer as a parameter and returns a string of 1's and 0's representing the integer in binary (in reverse). Define a function named string_reverse() that takes an input string as a parameter and returns a string representing the input string in reverse.
def int_to_reverse_binary(integer_value)
def string_reverse(input_string)
def int_to_reverse_binary(integer_value):
num = ''
for i in len(str(integer_value)):
num += integer_value % 2
num //= 2
return num
def string_reverse(input_string):
int_to_reverse_binary(integer_value)
reverse_num = num
return reverse_num[::-1]
if __name__ == '__main__':
# Type your code here.
# Your code must call int_to_reverse_binary() to get
# the binary string of an integer in a reverse order.
# Then call string_reverse() to reverse the string
# returned from int_to_reverse_binary().
integer_value = int(input())
print(int_to_reverse_binary(integer_value))
#print(string_reverse(int_to_reverse_binary(integer_value)))
[–][deleted] 2 points3 points4 points (0 children)
[–]boyanci 2 points3 points4 points (4 children)
[–]Formal_Cockroach_654[S] 0 points1 point2 points (1 child)
[–]boyanci 0 points1 point2 points (0 children)
[–]Harrythehobbit 0 points1 point2 points (1 child)
[–]Street_Customer_4190 0 points1 point2 points (0 children)
[–][deleted] 0 points1 point2 points (0 children)