I'm a college student working out of programming pearls as a means of studying. I'm kind of stumped at the following question.
Column 3 problems:
Write a program that displays a 16-bit positivwe integer in five seven-segment digits. The output is an array of 5 bytes; bit i of byte j is on if and only if the ith segment of digit j should be on.
Even after doing some reading I'm a bit confused, anyone worked with the book before and know a good place to start? Or can shed some light on the problem? Thanks in advance
