• Lets attempt implementing an algorithm we have seen before: decimal to binary conversion (8 bits only)
• Create a function that takes in an unsigned int as its input and has a void output.
  • The function will print the binary value of the unsigned int.
  • Reference slides 39 and 40 from this week.
  • ALGORITHM: Pick either this algorithm or the alternative one (you only have to implement one)
    • Start with an exponent of 128.
    • while(exponent >= 1)
      • if (n >= exponent)
        • print 1
        • n = n exponent
      • else if (n < exponent)
        • print 0
      • exponent = exponent / 2;
  • Alternative Algorithm - This one may be harder, but more interesting
    • There is an alternative method you may consider (but may be more difficult).
    • You may extract the actual bit from the unsigned int as shown on slide 47 from this week.
      • Beware Endianness (ordering of bits).
      • This means you may find the bits in the wrong order and need to reverse it.
        • For example: 4 may print as 00100000
        • Reverse your loop to have it print 00000100
• Create a main function that reads in an unsigned int value from the user.
• Pass the value to the function so its binary code is printed.