1.0Camdemy1.0http://media.usc.edu.tw時間複雜度: 數數字(The Digit Counting Problem)http://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/a/a88f1097895bd098/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare581' frameborder='0' src='http://media.usc.edu.tw/media/e/581' allowfullscreen></iframe>video72040551:0801234567890123456789012345601Observation 1: brute force by counting horizontally02Observation 2: smart by counting vertically03Observation 3: x parts of 十位數 of 16504Observation 4: x parts of 十位數 of 16505Observation 5 : y parts of 十位數 of 16506Observation 6: z parts of 十位數 of 16507Observation 7: (x, y, z) parts of 個位數 of 16508Observation 8: (x, y, z) parts of 佰位數 of 16509Observation 9: remove leading zeroes010Observation 10: x, y, z, and leading zeroes011Core program:012Conclusion: Brute force vs. Smart013Brute force programming014Conclusion: Brute force vs. Smart015fs1364x768720x4041280x7201364x768http://media.usc.edu.tw/sysdata/doc/a/a88f1097895bd098/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/a/a88f1097895bd098/cover.jpghttp://media.usc.edu.tw/sysdata/doc/a/a88f1097895bd098/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/a/a88f1097895bd0981