{"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":"Fibonacci: O(2^N)'den O(1)'e Ge\u00e7i\u015f","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"BlnRhEQbEH\"><a href=\"https:\/\/fatihsoysal.com\/blog\/fibonacci-o2nden-o1e-gecis\/\">Fibonacci: O(2^N)&#8217;den O(1)&#8217;e Ge\u00e7i\u015f<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/fibonacci-o2nden-o1e-gecis\/embed\/#?secret=BlnRhEQbEH\" width=\"600\" height=\"338\" title=\"&#8220;Fibonacci: O(2^N)&#8217;den O(1)&#8217;e Ge\u00e7i\u015f&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"BlnRhEQbEH\" 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":"Fibonacci dizisi, matematik ve bilgisayar bilimlerinde s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z, her terimin kendinden \u00f6nceki iki terimin toplam\u0131 olarak tan\u0131mlanan bir say\u0131 dizisidir. Bu diziyi hesaplaman\u0131n bir\u00e7ok yolu vard\u0131r ve bu yollar\u0131n karma\u015f\u0131kl\u0131klar\u0131 (zaman karma\u015f\u0131kl\u0131\u011f\u0131) olduk\u00e7a farkl\u0131l\u0131k g\u00f6sterir. Bu makalede, Fibonacci dizisini hesaplaman\u0131n farkl\u0131 y\u00f6ntemlerini, bunlar\u0131n zaman karma\u015f\u0131kl\u0131klar\u0131n\u0131 ve \u00f6zellikle O(2^N) karma\u015f\u0131kl\u0131\u011f\u0131ndan O(1) karma\u015f\u0131kl\u0131\u011f\u0131na nas\u0131l ula\u015fabilece\u011fimizi detayl\u0131 olarak inceleyece\u011fiz. Fatih Soysal olarak sizlere bu konuyu ad\u0131m ad\u0131m a\u00e7\u0131klayaca\u011f\u0131m."}