{"version":"1.0","provider_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","provider_url":"https:\/\/fatihsoysal.com\/blog","author_name":"Fatih Soysal","author_url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/","title":"Dinamik Programlama ile Fibonacci Say\u0131lar\u0131n\u0131 Hesaplama","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"v1e9N1TfdN\"><a href=\"https:\/\/fatihsoysal.com\/blog\/dinamik-programlama-ile-fibonacci-sayilarini-hesaplama\/\">Dinamik Programlama ile Fibonacci Say\u0131lar\u0131n\u0131 Hesaplama<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/dinamik-programlama-ile-fibonacci-sayilarini-hesaplama\/embed\/#?secret=v1e9N1TfdN\" width=\"600\" height=\"338\" title=\"&#8220;Dinamik Programlama ile Fibonacci Say\u0131lar\u0131n\u0131 Hesaplama&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"v1e9N1TfdN\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n<\/script>\n","description":"Merhaba! Bug\u00fcn, JavaScript kullanarak Fibonacci say\u0131lar\u0131n\u0131 hesaplaman\u0131n en verimli yollar\u0131ndan biri olan dinamik programlama y\u00f6ntemini ele alaca\u011f\u0131z. Bildi\u011finiz gibi, Fibonacci dizisi, her say\u0131n\u0131n kendisinden \u00f6nce gelen iki say\u0131n\u0131n toplam\u0131 oldu\u011fu bir say\u0131 dizisidir (0, 1, 1, 2, 3, 5, 8, 13...). Ancak, basit bir yinelemeli yakla\u015f\u0131m, b\u00fcy\u00fck say\u0131lar i\u00e7in olduk\u00e7a yava\u015f ve verimsiz olabilir. \u0130\u015fte bu noktada dinamik programlama devreye giriyor."}