{"id":683,"date":"2012-06-25T13:23:11","date_gmt":"2012-06-25T12:23:11","guid":{"rendered":"http:\/\/blogs.kent.ac.uk\/mik\/?p=683"},"modified":"2022-09-14T15:22:55","modified_gmt":"2022-09-14T15:22:55","slug":"joc-31","status":"publish","type":"post","link":"https:\/\/blogs.kcl.ac.uk\/proged\/2012\/06\/25\/joc-31\/","title":{"rendered":"JoC #31: More loopiness"},"content":{"rendered":"<p><em>\u00a0 \u00a0 \u00a0 The First Law of Programmer Creativity: &#8220;The cost of software maintenance\u00a0<\/em><br \/>\n<em>\u00a0 \u00a0 \u00a0 increases with the square of the programmer&#8217;s creativity.&#8221;<\/em><br \/>\n<em>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u2014 (source unknown)\u00a0<\/em><\/p>\n<p>We continue with our breakout scenario, an also with our investigation of loops. Jumping right ahead, I show you both how to write a nested loop, and why and how never to do it.<\/p>\n<p><iframe loading=\"lazy\" title=\"The Joy of Code #31: More Loopiness\" width=\"584\" height=\"329\" src=\"https:\/\/www.youtube.com\/embed\/ZdHtIigMbjA?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe><\/p>\n<p style=\"text-align: right\"><a href=\"http:\/\/www.greenfoot.org\/static\/joc\/mov\/JOC-31.mov\">Download video<\/a><\/p>\n<p><strong>Concepts discussed<\/strong>:\u00a0<em>loops, while loop<\/em><\/p>\n<p>Download:\u00a0<a href=\"http:\/\/www.greenfoot.org\/download\/files\/joc\/breakout-v5.zip\">breakout-v5.zip<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u00a0 \u00a0 \u00a0 The First Law of Programmer Creativity: &#8220;The cost of software maintenance\u00a0 \u00a0 \u00a0 \u00a0 increases with the square of the programmer&#8217;s creativity.&#8221; \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u2014 (source unknown)\u00a0 We continue with our breakout scenario, &hellip; <a href=\"https:\/\/blogs.kcl.ac.uk\/proged\/2012\/06\/25\/joc-31\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":179,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[15,6],"tags":[69,75,119],"class_list":["post-683","post","type-post","status-publish","format-standard","hentry","category-greenfoot-software-tools","category-joy-of-code","tag-loop","tag-nested-loop","tag-while-loop"],"_links":{"self":[{"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/posts\/683","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/users\/179"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/comments?post=683"}],"version-history":[{"count":2,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/posts\/683\/revisions"}],"predecessor-version":[{"id":1124,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/posts\/683\/revisions\/1124"}],"wp:attachment":[{"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/media?parent=683"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/categories?post=683"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.kcl.ac.uk\/proged\/wp-json\/wp\/v2\/tags?post=683"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}