{"id":4456,"date":"2020-11-21T00:01:21","date_gmt":"2020-11-21T08:01:21","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=4456"},"modified":"2020-11-23T06:15:57","modified_gmt":"2020-11-23T14:15:57","slug":"the-golden-ration-recursion-version","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=4456","title":{"rendered":"The Golden Ratio – Recursion Version"},"content":{"rendered":"

Oh, how I distrusted recursion when I was a budding programmer. It’s just a tough concept to wrap your head around, especially if you’re an old warhorse Assembly programmer like me who lives in fear of blowing up the stack. Trivial asides aside, recursion often presents an elegant and efficient way to solve a programming puzzle.
\n
\nThis time around, the puzzle is to calculate the golden ratio<\/a>, φ, which was covered in last week’s Lesson<\/a>. Figure 1 shows the nifty animation I created to illustrate the ratio, which is wordy and strange to explain, so enjoy the pretty colors.<\/p>\n

\"Golden

Figure 1. An animation showing the relationship between ‘a’ and ‘b’ relative to each other.<\/p><\/div>\n

Last week’s Lesson covered the straightforward way of calculation the value of φ: (1+√5)\/2 = 1.6180339887…<\/p>\n

Other methods exist to calculate the golden ratio, specifically continued fractions. One such fraction is illustrated in Figure 2. Please! Don’t let its appearance alarm you.<\/p>\n

\"phi

Figure 1. Calculating φ as a continued fraction – something that begs for a recursive function.<\/p><\/div>\n

These continued fraction boogers can be elegantly transformed into a recursive<\/a> function. Such an expression may not be obvious at first, but because I’m a nerd and I’ve been doing the programming thing a while, it took only a moment to figure it out:<\/p>\n

2020_11_21-Lesson.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n\r\ndouble phi(double p, int precision)\r\n{\r\n    while(precision)\r\n        return( p + 1\/phi(p, precision-1) );\r\n    return(p);\r\n}\r\n\r\nint main()\r\n{\r\n    double gr;\r\n\r\n    gr = phi(1.0,15);\r\n    printf(\"The golden radio is %f\\n\",gr);\r\n\r\n    return(0);\r\n}<\/pre>\n
The phi()<\/em> function is recursive. Its two arguments are double<\/em> p<\/code>, and int<\/em> precision<\/code>. The precision<\/code> argument determines how many times the function recurses, which also plays into the accuracy of the value returned.<\/p>\n
Within the return<\/em> statement, the expression p + 1\/phi(p, precision-1)<\/code> is a representation of the continued fraction shown in Figure 2. This result isn’t calculated until the value of precision<\/code> reaches zero, and the while<\/em> loop stops. At this point, the final return<\/em> statement is executed and the function unwinds, modifying the value of p<\/code> until the golden ratio is calculated. Here’s a sample run:<\/p>\n
The golden radio is 1.618034<\/code><\/p>\n
I experimented a bit with the precision value passed at Line 15. The value 15 seems to be the minimum required to render a proper value for φ for the digits output.<\/p>\n
If I were required to use φ in my code, I would most likely declare it as a defined constant, stretching it out to 20 or so digits as necessary:<\/p>\n
#define PHI 1.6180339887498948482<\/code><\/p>\n
Still, programming is often about exercising the mind as often as it’s about solving math problems. Though recursion can be a frustrating concept, I enjoy working out a recursive function. It can be delightful when it actually works and doesn’t blow up the computer.<\/p>\n","protected":false},"excerpt":{"rendered":"
As a C coder, I am delighted to offer any code that takes advantage of recursion. Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-4456","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4456","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4456"}],"version-history":[{"count":7,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4456\/revisions"}],"predecessor-version":[{"id":4486,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4456\/revisions\/4486"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4456"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4456"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4456"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}