{"action":"created","issue":{"url":"https://api.github.com/repos/madridjs/talks/issues/1","labels_url":"https://api.github.com/repos/madridjs/talks/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/madridjs/talks/issues/1/comments","events_url":"https://api.github.com/repos/madridjs/talks/issues/1/events","html_url":"https://github.com/madridjs/talks/issues/1","id":55187940,"number":1,"title":"Fibonacci everywhere","user":{"login":"Franx0","id":8995180,"avatar_url":"https://avatars.githubusercontent.com/u/8995180?v=3","gravatar_id":"","url":"https://api.github.com/users/Franx0","html_url":"https://github.com/Franx0","followers_url":"https://api.github.com/users/Franx0/followers","following_url":"https://api.github.com/users/Franx0/following{/other_user}","gists_url":"https://api.github.com/users/Franx0/gists{/gist_id}","starred_url":"https://api.github.com/users/Franx0/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Franx0/subscriptions","organizations_url":"https://api.github.com/users/Franx0/orgs","repos_url":"https://api.github.com/users/Franx0/repos","events_url":"https://api.github.com/users/Franx0/events{/privacy}","received_events_url":"https://api.github.com/users/Franx0/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":3,"created_at":"2015-01-22T18:08:15Z","updated_at":"2015-02-15T15:50:39Z","closed_at":null,"body":"Propongo una charla introductoria de Javascript en la que se explicará la sucesión de Fibonacci de manera sencilla. \r\nPara ello propongo realizar un ejercicio en el que se cree y ejecute un código capaz de generar la sucesión de Fibonacci utilizando diferentes bucles e incluso funciones recursivas.\r\nConsidero que es un buen ejercicio introductorio en el que además se revisarán conceptos como array, bucle, condición, función, variable, contador, el comportamiento de Javascript para contar elementos, etc.\r\n\r\nMi nombre es Fran, tengo 25 años, estoy empezando en esto de la programación pero he descubierto que me encanta. Me he formado en la escuela Ironhack de Madrid y soy un culo inquieto, siempre intentando hacer cosas nuevas y diferentes.\r\nMe encanta el mundo de la música y además aporreo la guitarra (en mi casa todos sordos ¬¬)\r\nPodéis conocer un poco más de mí en el siguiente enlace:\r\nhttp://write2learn.herokuapp.com/\r\n\r\nSaludetes compañeros ;)\r\n\r\n"},"comment":{"url":"https://api.github.com/repos/madridjs/talks/issues/comments/74422626","html_url":"https://github.com/madridjs/talks/issues/1#issuecomment-74422626","issue_url":"https://api.github.com/repos/madridjs/talks/issues/1","id":74422626,"user":{"login":"Serabe","id":36221,"avatar_url":"https://avatars.githubusercontent.com/u/36221?v=3","gravatar_id":"","url":"https://api.github.com/users/Serabe","html_url":"https://github.com/Serabe","followers_url":"https://api.github.com/users/Serabe/followers","following_url":"https://api.github.com/users/Serabe/following{/other_user}","gists_url":"https://api.github.com/users/Serabe/gists{/gist_id}","starred_url":"https://api.github.com/users/Serabe/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Serabe/subscriptions","organizations_url":"https://api.github.com/users/Serabe/orgs","repos_url":"https://api.github.com/users/Serabe/repos","events_url":"https://api.github.com/users/Serabe/events{/privacy}","received_events_url":"https://api.github.com/users/Serabe/received_events","type":"User","site_admin":false},"created_at":"2015-02-15T15:50:39Z","updated_at":"2015-02-15T15:50:39Z","body":"Sería interesante que en el caso de usar funciones recursivas se hiciese una que se pudiera optimizar (usando tail call optimization) ya que ES6/ES2015/ES${ponga el nombre que le dé la gana} introduce TCO."}}