This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: so there are n multiplications and n additions in all. 26 . Each iteration (determining whether we can use a coin of a given denomination) takes a bounded amount of time, and there are at most n iterations, since each iteration decreases the number of cents remaining. Therefore there are O(n) comparisons ....
View
Full Document
 Spring '09

Click to edit the document details