This preview shows page 1. Sign up to view the full content.
Unformatted text preview: and coins ($2, $1, 25¢, 10¢, 5¢, 1¢). This is an automatic change-maker and should give the minimum number of bills and coins possible. Exercises from Chapter 5 which use loops: 14. Write a program that will count the number of digits in a positive integer that is input. 15. Write a program that will tell whether an integer is a palindrome, that is, has the same value with the digits reversed. Examples of integer palindromes are 11, 323, and 7667....
View Full Document
This note was uploaded on 02/13/2012 for the course CSE 1540 taught by Professor Hofbauer during the Winter '12 term at York University.
- Winter '12