{"id":31231,"date":"2016-02-13T12:59:06","date_gmt":"2016-02-13T18:59:06","guid":{"rendered":"http:\/\/dariomagana10.wordpress.com\/?p=263"},"modified":"2016-02-13T13:53:25","modified_gmt":"2016-02-13T19:53:25","slug":"quiz03finally-video","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/02\/quiz03finally-video\/","title":{"rendered":"#Quiz03(finally!) VIDEO"},"content":{"rendered":"

This was the most difficult program i\u00b4ve done since i started coding. The first one was extremely easy but the fibonacci\u00b4s got me like<\/p>\n

\"24\"<\/p>\n

Well lets check the codes here\u00b4re both of my codes<\/a><\/p>\n

1st Program: Create a code that calculates the distance between two point in the cartesian plane.<\/h2>\n

Easy one, the user must type the coordenates of the two points(giving the x and y values of both of them) and using the pythagorean theorem\u00a0<\/a>getting the addition of the squares of the differences between x1-x2 and y1-y2. Well here\u00b4s a ss of the code and how it works<\/p>\n

\"dist\"<\/p>\n

Dont forget to add the cmath library to use the square root.<\/p>\n

2nd Program Fibonacci\u00b4s(wth)<\/h2>\n

Now we\u00b4re talking about serious stuff, doing this code was extremely difficult i was breaking my head because i was trying doing it with loops(and there must be a freaking way and later ill figure it out!) then i found the formula<\/p>\n

\"image62\"<\/p>\n

Anddd this helped a lot, to understand better the formula and the proccess. Friday in class me and AlexFoo<\/a>\u00a0found a website that explain the fibonacci(and the code) incredibly well. Here\u00b4s the page m8s<\/a><\/p>\n

Let\u00b4s check a quick video made by me, explaining the code and some of the fibonaccis uses.<\/p>\n