{"id":42716,"date":"2026-06-20T21:04:18","date_gmt":"2026-06-20T18:04:18","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/"},"modified":"2026-06-20T21:04:34","modified_gmt":"2026-06-20T18:04:34","slug":"donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/","title":{"rendered":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler"},"content":{"rendered":"<h2>D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler<\/h2>\n<p>G\u00fcn\u00fcm\u00fcz\u00fcn h\u0131zla geli\u015fen yaz\u0131l\u0131m d\u00fcnyas\u0131nda, veri yap\u0131lar\u0131 ve algoritmalar, performansl\u0131 uygulamalar geli\u015ftirmenin temel ta\u015flar\u0131d\u0131r. \u00d6zellikle b\u00fcy\u00fck veri k\u00fcmeleriyle \u00e7al\u0131\u015f\u0131rken, veriye eri\u015fim ve arama i\u015flemleri kritik \u00f6neme sahiptir. S\u0131ral\u0131 dizilerde arama yapmak i\u00e7in <a href=\"https:\/\/tr.wikipedia.org\/wiki\/%C4%B0kili_arama_algoritmas%C4%B1\" target=\"_blank\" rel=\"noopener\">ikili arama (binary search)<\/a> algoritmas\u0131, logaritmik zaman karma\u015f\u0131kl\u0131\u011f\u0131 sayesinde olduk\u00e7a verimli bir y\u00f6ntem sunar. Ancak ya dizimiz &#8220;d\u00f6nm\u00fc\u015f&#8221; ise? Yani, s\u0131ral\u0131 bir dizi belirli bir noktadan kesilip ba\u015f\u0131 sonuna eklenmi\u015fse, geleneksel ikili arama y\u00f6ntemleri yetersiz kalacakt\u0131r. \u0130\u015fte tam bu noktada, &#8220;D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizide Arama&#8221; problemi kar\u015f\u0131m\u0131za \u00e7\u0131kar ve bu makale, bu zorlu\u011fun \u00fcstesinden gelmek i\u00e7in geli\u015ftirilmi\u015f ikili arama y\u00f6ntemini derinlemesine inceleyecektir. Bu teknik, veritaban\u0131 indekslemeden, da\u011f\u0131t\u0131k sistemlerde veri bulmaya kadar pek \u00e7ok ger\u00e7ek d\u00fcnya senaryosunda kritik bir rol oynar.<\/p>\n<h2>D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: Neden Geleneksel Y\u00f6ntemler Yetmez?<\/h2>\n<p>Veri yap\u0131lar\u0131 aras\u0131nda s\u0131ral\u0131 diziler, belirli bir d\u00fczen i\u00e7inde tutulan elemanlar\u0131 sayesinde arama i\u015flemlerini kolayla\u015ft\u0131ran temel yap\u0131lar olarak \u00f6ne \u00e7\u0131kar. Geleneksel s\u0131ral\u0131 bir dizide, elemanlar k\u00fc\u00e7\u00fckten b\u00fcy\u00fc\u011fe (veya b\u00fcy\u00fckten k\u00fc\u00e7\u00fc\u011fe) do\u011fru bir s\u0131ra izler. \u00d6rne\u011fin, <code>[1, 2, 3, 4, 5, 6, 7]<\/code> gibi bir dizi, klasik ikili arama algoritmas\u0131 i\u00e7in ideal bir adayd\u0131r. \u0130kili arama, diziyi s\u00fcrekli olarak ikiye b\u00f6lerek arama alan\u0131n\u0131 daralt\u0131r ve bu sayede hedef eleman\u0131 \u00e7ok h\u0131zl\u0131 bir \u015fekilde bulur. Ancak, her zaman bu kadar ideal ko\u015fullarla kar\u015f\u0131la\u015fmay\u0131z. Bazen, bir s\u0131ral\u0131 dizi belirli bir &#8220;d\u00f6nme noktas\u0131&#8221; (pivot) etraf\u0131nda d\u00f6nebilir. Bu durum, dizinin s\u0131ral\u0131 \u00f6zelli\u011fini bozmaz, ancak s\u0131ral\u0131 par\u00e7alar\u0131n yerini de\u011fi\u015ftirir. \u00d6rne\u011fin, <code>[1, 2, 3, 4, 5, 6, 7]<\/code> dizisi 3. elemandan d\u00f6nd\u00fcr\u00fcld\u00fc\u011f\u00fcnde <code>[4, 5, 6, 7, 1, 2, 3]<\/code> \u015feklini alabilir. Bu yeni yap\u0131ya &#8220;d\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizi&#8221; (rotated sorted array) denir.<\/p>\n<p>Peki, b\u00f6yle bir dizide geleneksel ikili arama neden yetersiz kal\u0131r? Geleneksel ikili arama, her ad\u0131mda dizinin orta eleman\u0131n\u0131 kontrol eder ve aranan de\u011ferin bu orta elemandan b\u00fcy\u00fck m\u00fc k\u00fc\u00e7\u00fck m\u00fc oldu\u011funa bakarak arama alan\u0131n\u0131 sol veya sa\u011f yar\u0131ya indirir. Bu mant\u0131k, dizinin tek bir b\u00fct\u00fcn olarak s\u0131ral\u0131 oldu\u011fu varsay\u0131m\u0131na dayan\u0131r. Ancak d\u00f6nm\u00fc\u015f bir dizide bu varsay\u0131m ge\u00e7erli de\u011fildir. \u00d6rne\u011fin, <code>[4, 5, 6, 7, 1, 2, 3]<\/code> dizisinde <code>1<\/code> de\u011ferini arad\u0131\u011f\u0131m\u0131z\u0131 varsayal\u0131m. E\u011fer orta eleman <code>7<\/code> ise, <code>1<\/code> de\u011feri <code>7<\/code>&#8216;den k\u00fc\u00e7\u00fckt\u00fcr. Geleneksel ikili arama, bu durumda arama alan\u0131n\u0131 sol yar\u0131ya (<code>[4, 5, 6]<\/code>) indirgeyecektir ki bu yanl\u0131\u015ft\u0131r, \u00e7\u00fcnk\u00fc <code>1<\/code> asl\u0131nda dizinin sa\u011f yar\u0131s\u0131ndad\u0131r. Bu durum, algoritman\u0131n aranan eleman\u0131 ka\u00e7\u0131rmas\u0131na veya sonsuz d\u00f6ng\u00fcye girmesine neden olabilir. Dolay\u0131s\u0131yla, d\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerde arama yapmak i\u00e7in geleneksel ikili araman\u0131n mant\u0131\u011f\u0131n\u0131, dizinin d\u00f6nm\u00fc\u015f yap\u0131s\u0131n\u0131 dikkate alacak \u015fekilde de\u011fi\u015ftirmemiz, yani &#8220;modifiye etmemiz&#8221; gerekmektedir. Bu modifikasyon, hangi yar\u0131n\u0131n s\u0131ral\u0131 oldu\u011funu ve hedef de\u011ferin bu s\u0131ral\u0131 yar\u0131da olup olmad\u0131\u011f\u0131n\u0131 ak\u0131ll\u0131ca belirleyerek arama aral\u0131\u011f\u0131n\u0131 do\u011fru bir \u015fekilde daraltmay\u0131 hedefler.<\/p>\n<h2>\u0130kili Araman\u0131n Temelleri ve D\u00f6nm\u00fc\u015f Dizinin Yap\u0131s\u0131 Nas\u0131l Anla\u015f\u0131l\u0131r?<\/h2>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerde arama problemine ge\u00e7meden \u00f6nce, ikili arama algoritmas\u0131n\u0131n temel prensiplerini ve d\u00f6nm\u00fc\u015f dizinin kendine has yap\u0131s\u0131n\u0131 anlamak \u00f6nemlidir. Bu temel bilgiler, modifiye edilmi\u015f algoritman\u0131n neden ve nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 kavramam\u0131z\u0131 sa\u011flayacakt\u0131r.<\/p>\n<h3>\u0130kili Arama (Binary Search) Algoritmas\u0131na K\u0131sa Bir Bak\u0131\u015f<\/h3>\n<p>\u0130kili arama, s\u0131ral\u0131 bir dizide belirli bir eleman\u0131n konumunu bulmak i\u00e7in kullan\u0131lan olduk\u00e7a verimli bir arama algoritmas\u0131d\u0131r. Algoritma, &#8220;b\u00f6l ve y\u00f6net&#8221; (divide and conquer) prensibine dayan\u0131r ve a\u015fa\u011f\u0131daki ad\u0131mlar\u0131 izler:<\/p>\n<ol>\n<li>Dizinin ortas\u0131ndaki eleman\u0131 belirle.<\/li>\n<li>Aranan de\u011ferin (hedef) bu orta elemanla kar\u015f\u0131la\u015ft\u0131r.<\/li>\n<li>E\u011fer hedef, orta elemana e\u015fitse, eleman bulundu ve algoritma sona erer.<\/li>\n<li>E\u011fer hedef, orta elemandan k\u00fc\u00e7\u00fckse, arama alan\u0131n\u0131 dizinin sol yar\u0131s\u0131na daralt.<\/li>\n<li>E\u011fer hedef, orta elemandan b\u00fcy\u00fckse, arama alan\u0131n\u0131 dizinin sa\u011f yar\u0131s\u0131na daralt.<\/li>\n<li>Bu ad\u0131mlar\u0131, hedef bulunana veya arama alan\u0131 bo\u015falana kadar tekrarla.<\/li>\n<\/ol>\n<p>Bu y\u00f6ntem sayesinde, her ad\u0131mda arama alan\u0131 yar\u0131ya indirilir ve bu da algoritman\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131n\u0131 <code>O(log n)<\/code> yapar. Bu, \u00f6zellikle b\u00fcy\u00fck dizilerde do\u011frusal arama (<code>O(n)<\/code>) y\u00f6ntemine g\u00f6re \u00e7ok daha h\u0131zl\u0131 bir performans sunar. \u00d6rne\u011fin, 1 milyon elemanl\u0131 bir dizide do\u011frusal arama ortalama 500 bin ad\u0131m s\u00fcrerken, ikili arama sadece yakla\u015f\u0131k 20 ad\u0131mda sonuca ula\u015fabilir. Bu verimlilik, onu bir\u00e7ok arama g\u00f6revi i\u00e7in vazge\u00e7ilmez k\u0131lar.<\/p>\n<h3>D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizinin Benzersiz Yap\u0131s\u0131<\/h3>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizi, asl\u0131nda orijinal olarak s\u0131ral\u0131 olan bir dizinin belirli bir noktadan kesilip iki par\u00e7an\u0131n yer de\u011fi\u015ftirmesiyle olu\u015fur. \u00d6rne\u011fin, <code>[1, 2, 3, 4, 5, 6, 7]<\/code> dizisi <code>4<\/code> noktas\u0131ndan d\u00f6nd\u00fcr\u00fcld\u00fc\u011f\u00fcnde <code>[4, 5, 6, 7, 1, 2, 3]<\/code> haline gelir. Bu yeni dizinin en belirgin \u00f6zelli\u011fi, dizinin iki farkl\u0131 s\u0131ral\u0131 par\u00e7adan olu\u015fmas\u0131d\u0131r. \u0130lk par\u00e7a (<code>[4, 5, 6, 7]<\/code>) kendi i\u00e7inde s\u0131ral\u0131d\u0131r ve ikinci par\u00e7a (<code>[1, 2, 3]<\/code>) da kendi i\u00e7inde s\u0131ral\u0131d\u0131r. Ancak, ilk par\u00e7an\u0131n son eleman\u0131 (<code>7<\/code>) ile ikinci par\u00e7an\u0131n ilk eleman\u0131 (<code>1<\/code>) aras\u0131nda bir &#8220;s\u0131\u00e7rama&#8221; veya &#8220;d\u00f6nme noktas\u0131&#8221; bulunur. Bu d\u00f6nme noktas\u0131nda, dizinin genel s\u0131ral\u0131 d\u00fczeni bozulur.<\/p>\n<p>D\u00f6nm\u00fc\u015f bir dizide her zaman en az bir yar\u0131n\u0131n s\u0131ral\u0131 olaca\u011f\u0131 g\u00f6zlemini yapmak, modifiye edilmi\u015f ikili arama i\u00e7in anahtard\u0131r. \u00d6rne\u011fin, <code>[4, 5, 6, 7, 1, 2, 3]<\/code> dizisinde orta eleman <code>7<\/code> ise, sol yar\u0131s\u0131 <code>[4, 5, 6]<\/code> s\u0131ral\u0131d\u0131r, sa\u011f yar\u0131s\u0131 <code>[1, 2, 3]<\/code> de s\u0131ral\u0131d\u0131r ama <code>7<\/code>&#8216;den sonra gelmesine ra\u011fmen <code>7<\/code>&#8216;den k\u00fc\u00e7\u00fckt\u00fcr. E\u011fer orta eleman <code>1<\/code> olsayd\u0131, sol taraf <code>[4, 5, 6, 7]<\/code> s\u0131ral\u0131, sa\u011f taraf <code>[2, 3]<\/code> s\u0131ral\u0131 olacakt\u0131. Bu g\u00f6zlem, algoritman\u0131n her ad\u0131mda hangi yar\u0131da arama yapaca\u011f\u0131na karar vermesinde kritik bir rol oynar. Algoritma, hangi yar\u0131n\u0131n &#8220;d\u00fczg\u00fcn s\u0131ral\u0131&#8221; oldu\u011funu tespit eder ve aranan hedef de\u011ferin bu s\u0131ral\u0131 yar\u0131da olup olmad\u0131\u011f\u0131n\u0131 kontrol eder. E\u011fer hedef s\u0131ral\u0131 yar\u0131daysa, arama alan\u0131 o yar\u0131ya daralt\u0131l\u0131r. Aksi takdirde, hedef di\u011fer (d\u00f6nm\u00fc\u015f) yar\u0131da olmal\u0131d\u0131r ve arama alan\u0131 o yar\u0131ya kayd\u0131r\u0131l\u0131r. Bu ak\u0131l y\u00fcr\u00fctme, geleneksel ikili araman\u0131n temelini korurken, d\u00f6nm\u00fc\u015f dizinin karma\u015f\u0131k yap\u0131s\u0131n\u0131 ba\u015far\u0131yla y\u00f6netmemizi sa\u011flar.<\/p>\n<h2>De\u011fi\u015ftirilmi\u015f \u0130kili Arama Algoritmas\u0131: Ad\u0131m Ad\u0131m Yakla\u015f\u0131m<\/h2>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerde arama yapmak i\u00e7in geleneksel ikili araman\u0131n yetersiz kald\u0131\u011f\u0131n\u0131 anlad\u0131k. \u015eimdi, bu \u00f6zel durumu ele almak i\u00e7in algoritmam\u0131z\u0131 nas\u0131l de\u011fi\u015ftirece\u011fimizi ad\u0131m ad\u0131m inceleyelim. Temel fikir, dizinin hangi k\u0131sm\u0131n\u0131n s\u0131ral\u0131 oldu\u011funu her ad\u0131mda belirlemek ve aranan de\u011ferin bu s\u0131ral\u0131 k\u0131s\u0131mda olup olmad\u0131\u011f\u0131n\u0131 kontrol etmektir. Bu sayede, arama alan\u0131m\u0131z\u0131 her zaman do\u011fru y\u00f6ne daraltabiliriz.<\/p>\n<h3>Algoritman\u0131n Temel Mant\u0131\u011f\u0131<\/h3>\n<p>De\u011fi\u015ftirilmi\u015f ikili arama algoritmas\u0131, geleneksel ikili arama gibi <code>sol (left)<\/code> ve <code>sa\u011f (right)<\/code> i\u015faret\u00e7ileriyle ba\u015flar ve orta eleman\u0131 (<code>mid<\/code>) hesaplar. Ancak, arama alan\u0131n\u0131 daraltma karar\u0131, <code>mid<\/code> eleman\u0131n\u0131n dizinin sol ucu (<code>nums[left]<\/code>) ve sa\u011f ucu (<code>nums[right]<\/code>) ile olan ili\u015fkisine g\u00f6re verilir. \u0130\u015fte temel ad\u0131mlar:<\/p>\n<ol>\n<li>\n            <strong>Ba\u015flang\u0131\u00e7 De\u011ferleri:<\/strong> <code>sol = 0<\/code> ve <code>sa\u011f = n - 1<\/code> (dizinin boyutu <code>n<\/code> ise).\n        <\/li>\n<li>\n            <strong>D\u00f6ng\u00fc Ko\u015fulu:<\/strong> <code>sol <= sa\u011f<\/code> oldu\u011fu s\u00fcrece d\u00f6ng\u00fcy\u00fc s\u00fcrd\u00fcr.\n        <\/li>\n<li>\n            <strong>Orta Eleman\u0131 Bul:<\/strong> <code>mid = sol + (sa\u011f - sol) \/\/ 2<\/code>. Bu hesaplama, b\u00fcy\u00fck say\u0131 ta\u015fmalar\u0131n\u0131 \u00f6nlemek i\u00e7in yayg\u0131n olarak tercih edilir.\n        <\/li>\n<li>\n            <strong>Hedef Bulundu mu?:<\/strong> E\u011fer <code>nums[mid] == hedef<\/code> ise, <code>mid<\/code> indeksini d\u00f6nd\u00fcr ve algoritmay\u0131 sonland\u0131r.\n        <\/li>\n<li>\n            <strong>Hangi Yar\u0131m S\u0131ral\u0131?:<\/strong> \u0130\u015fte kritik k\u0131s\u0131m. Dizinin iki yar\u0131s\u0131ndan biri mutlaka normal s\u0131ral\u0131 olacakt\u0131r. Bunu belirlemek i\u00e7in <code>nums[left]<\/code> ile <code>nums[mid]<\/code>'i kar\u015f\u0131la\u015ft\u0131r\u0131r\u0131z:<\/p>\n<ul>\n<li>\n                    <strong>E\u011fer <code>nums[left] <= nums[mid]<\/code> ise:<\/strong> Bu, dizinin sol yar\u0131s\u0131n\u0131n (<code>left<\/code>'ten <code>mid<\/code>'e kadar olan k\u0131sm\u0131n) normal s\u0131ral\u0131 oldu\u011fu anlam\u0131na gelir. \u00d6rne\u011fin, <code>[4, 5, 6, 7, 1, 2, 3]<\/code> dizisinde <code>left=0 (4)<\/code>, <code>mid=3 (7)<\/code> ise <code>4 <= 7<\/code>.<\/p>\n<ul>\n<li>\u015eimdi hedef bu s\u0131ral\u0131 sol yar\u0131da m\u0131 kontrol et: E\u011fer <code>nums[left] <= hedef < nums[mid]<\/code> ise, hedef sol yar\u0131dad\u0131r. Bu durumda, arama alan\u0131n\u0131 sa\u011fdan daralt: <code>sa\u011f = mid - 1<\/code>.<\/li>\n<li>Aksi takdirde, hedef sa\u011f yar\u0131da olmal\u0131d\u0131r (d\u00f6nm\u00fc\u015f k\u0131s\u0131mda). Bu durumda, arama alan\u0131n\u0131 soldan geni\u015flet: <code>sol = mid + 1<\/code>.<\/li>\n<\/ul>\n<\/li>\n<li>\n                    <strong>E\u011fer <code>nums[left] > nums[mid]<\/code> ise:<\/strong> Bu, dizinin sa\u011f yar\u0131s\u0131n\u0131n (<code>mid<\/code>'den <code>right<\/code>'a kadar olan k\u0131sm\u0131n) normal s\u0131ral\u0131 oldu\u011fu anlam\u0131na gelir. \u00d6rne\u011fin, <code>[6, 7, 1, 2, 3, 4, 5]<\/code> dizisinde <code>left=0 (6)<\/code>, <code>mid=2 (1)<\/code> ise <code>6 > 1<\/code>.<\/p>\n<ul>\n<li>\u015eimdi hedef bu s\u0131ral\u0131 sa\u011f yar\u0131da m\u0131 kontrol et: E\u011fer <code>nums[mid] < hedef <= nums[right]<\/code> ise, hedef sa\u011f yar\u0131dad\u0131r. Bu durumda, arama alan\u0131n\u0131 soldan geni\u015flet: <code>sol = mid + 1<\/code>.<\/li>\n<li>Aksi takdirde, hedef sol yar\u0131da olmal\u0131d\u0131r (d\u00f6nm\u00fc\u015f k\u0131s\u0131mda). Bu durumda, arama alan\u0131n\u0131 sa\u011fdan daralt: <code>sa\u011f = mid - 1<\/code>.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<li>\n            <strong>Hedef Bulunamad\u0131:<\/strong> D\u00f6ng\u00fc bitti\u011finde hedef bulunamad\u0131ysa, <code>-1<\/code> d\u00f6nd\u00fcr (veya uygun bir \"bulunamad\u0131\" de\u011feri).\n        <\/li>\n<\/ol>\n<h3>Arama Aral\u0131klar\u0131n\u0131 Ak\u0131ll\u0131ca Daraltma<\/h3>\n<p>Algoritman\u0131n ana g\u00fcc\u00fc, her ad\u0131mda dizinin hangi k\u0131sm\u0131n\u0131n s\u0131ral\u0131 oldu\u011funu belirleyebilmesidir. Bu, bize hedef de\u011ferin bu s\u0131ral\u0131 k\u0131s\u0131mda olup olmad\u0131\u011f\u0131n\u0131 g\u00fcvenle kontrol etme imkan\u0131 verir. E\u011fer hedef, s\u0131ral\u0131 k\u0131s\u0131mda ise, arama alan\u0131m\u0131z\u0131 o k\u0131sma daralt\u0131r\u0131z. E\u011fer hedef s\u0131ral\u0131 k\u0131s\u0131mda de\u011filse, o zaman zorunlu olarak di\u011fer (d\u00f6nm\u00fc\u015f) k\u0131s\u0131mda olmal\u0131d\u0131r ve arama alan\u0131m\u0131z\u0131 o y\u00f6ne kayd\u0131r\u0131r\u0131z. Bu mant\u0131k, dizinin d\u00f6nm\u00fc\u015f yap\u0131s\u0131n\u0131 etkili bir \u015fekilde kullanarak ikili araman\u0131n logaritmik zaman karma\u015f\u0131kl\u0131\u011f\u0131n\u0131 korumas\u0131n\u0131 sa\u011flar.<\/p>\n<p>\u00d6rne\u011fin, <code>[4, 5, 6, 7, 0, 1, 2]<\/code> dizisinde <code>0<\/code> de\u011ferini arad\u0131\u011f\u0131m\u0131z\u0131 d\u00fc\u015f\u00fcnelim. Ba\u015flang\u0131\u00e7ta <code>left=0, right=6<\/code>. Orta eleman <code>mid=3 (7)<\/code>.<br \/>\n    <code>nums[left] (4) <= nums[mid] (7)<\/code> oldu\u011fu i\u00e7in sol taraf s\u0131ral\u0131 (<code>[4, 5, 6, 7]<\/code>).<br \/>\n    Hedef <code>0<\/code>, bu aral\u0131kta de\u011fil (<code>4 <= 0 < 7<\/code> yanl\u0131\u015f).<br \/>\n    \u00d6yleyse, hedef sa\u011f tarafta olmal\u0131: <code>sol = mid + 1 = 4<\/code>.<br \/>\n    Yeni aral\u0131k: <code>[0, 1, 2]<\/code>. <code>left=4, right=6<\/code>. Orta eleman <code>mid=5 (1)<\/code>.<br \/>\n    <code>nums[left] (0) <= nums[mid] (1)<\/code> oldu\u011fu i\u00e7in sol taraf s\u0131ral\u0131 (<code>[0, 1]<\/code>).<br \/>\n    Hedef <code>0<\/code>, bu aral\u0131kta (<code>0 <= 0 < 1<\/code> do\u011fru).<br \/>\n    \u00d6yleyse, arama alan\u0131n\u0131 sola daralt: <code>sa\u011f = mid - 1 = 4<\/code>.<br \/>\n    Yeni aral\u0131k: <code>[0]<\/code>. <code>left=4, right=4<\/code>. Orta eleman <code>mid=4 (0)<\/code>.<br \/>\n    <code>nums[mid] (0) == hedef (0)<\/code>. Hedef bulundu! \u0130ndeks <code>4<\/code> d\u00f6nd\u00fcr\u00fcl\u00fcr.<\/p>\n<p>Bu ak\u0131ll\u0131 daraltma stratejisi, d\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerde bile ikili araman\u0131n \u00fcst\u00fcn performans\u0131n\u0131 s\u00fcrd\u00fcrmesini sa\u011flar. Algoritman\u0131n her ad\u0131mda do\u011fru y\u00f6ne karar vermesi, onu bu t\u00fcr problemler i\u00e7in g\u00fc\u00e7l\u00fc bir \u00e7\u00f6z\u00fcm haline getirir.<\/p>\n<h2>Uygulamal\u0131 \u00d6rnek ve Kod \u0130ncelemesi: Bir Vaka Analizi<\/h2>\n<p>Teorik bilgileri peki\u015ftirmek ve algoritman\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 daha iyi anlamak i\u00e7in somut bir vaka analizi ve Python dilinde bir kod \u00f6rne\u011fi inceleyelim. Bu b\u00f6l\u00fcm, algoritmay\u0131 ger\u00e7ek bir senaryoda uygulaman\u0131n inceliklerini ve kodun ad\u0131m ad\u0131m nas\u0131l i\u015fledi\u011fini g\u00f6sterecektir.<\/p>\n<h3>Senaryo: Bir Envanter Sisteminde \u00dcr\u00fcn Arama<\/h3>\n<p>Bir e-ticaret \u015firketinin b\u00fcy\u00fck bir \u00fcr\u00fcn envanteri oldu\u011funu d\u00fc\u015f\u00fcn\u00fcn. \u00dcr\u00fcnler, genellikle stok kodu veya ID'ye g\u00f6re s\u0131ral\u0131 bir veritaban\u0131 indeksinde tutulur. Ancak, sistemde yap\u0131lan d\u00fczenli bak\u0131mlar veya veritaban\u0131 optimizasyonlar\u0131 s\u0131ras\u0131nda, bu indeks bazen fiziksel olarak \"d\u00f6nebilir\". Yani, s\u0131ral\u0131 olan ID'ler belirli bir noktadan kesilip dizinin sonuna eklenebilir. \u00d6rne\u011fin, ID'leri <code>[101, 105, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200]<\/code> olan bir dizimiz varken, bir optimizasyon sonras\u0131 bu dizi <code>[140, 150, 160, 170, 180, 190, 200, 101, 105, 110, 120, 130]<\/code> haline gelebilir. M\u00fc\u015fteriler veya depo \u00e7al\u0131\u015fanlar\u0131 belirli bir \u00fcr\u00fcn ID'sini arad\u0131\u011f\u0131nda, sistemin bu d\u00f6nm\u00fc\u015f dizide bile \u00fcr\u00fcn\u00fc h\u0131zl\u0131ca bulmas\u0131 gerekmektedir. \u0130\u015fte bu noktada, de\u011fi\u015ftirilmi\u015f ikili arama algoritmas\u0131 devreye girer.<\/p>\n<h3>Python ile Algoritma Uygulamas\u0131<\/h3>\n<p>A\u015fa\u011f\u0131daki Python kodu, yukar\u0131da a\u00e7\u0131klanan de\u011fi\u015ftirilmi\u015f ikili arama algoritmas\u0131n\u0131 uygulamaktad\u0131r. Bu kod, verilen bir d\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizide belirli bir hedef de\u011feri arar ve e\u011fer bulursa indeksini, bulamazsa <code>-1<\/code> de\u011ferini d\u00f6nd\u00fcr\u00fcr.<\/p>\n<div class=\"code-container\">\n<pre><code>\ndef search_rotated_sorted_array(nums, target):\n    \"\"\"\n    D\u00f6nm\u00fc\u015f s\u0131ral\u0131 bir dizide hedef de\u011feri arar.\n    Args:\n        nums (list): D\u00f6nm\u00fc\u015f s\u0131ral\u0131 tamsay\u0131 dizisi.\n        target (int): Aranacak hedef tamsay\u0131.\n    Returns:\n        int: Hedefin indeksi e\u011fer bulunursa, aksi takdirde -1.\n    \"\"\"\n    left, right = 0, len(nums) - 1\n\n    while left <= right:\n        mid = left + (right - left) \/\/ 2\n\n        # Hedef bulundu mu?\n        if nums[mid] == target:\n            return mid\n\n        # Sol yar\u0131m s\u0131ral\u0131 m\u0131?\n        if nums[left] <= nums[mid]:\n            # Hedef sol s\u0131ral\u0131 yar\u0131da m\u0131?\n            if nums[left] <= target < nums[mid]:\n                right = mid - 1  # Arama alan\u0131n\u0131 sola daralt\n            else:\n                left = mid + 1   # Hedef sa\u011f d\u00f6nm\u00fc\u015f yar\u0131da olmal\u0131\n        # Sa\u011f yar\u0131m s\u0131ral\u0131 m\u0131?\n        else:\n            # Hedef sa\u011f s\u0131ral\u0131 yar\u0131da m\u0131?\n            if nums[mid] < target <= nums[right]:\n                left = mid + 1   # Arama alan\u0131n\u0131 sa\u011fa geni\u015flet\n            else:\n                right = mid - 1  # Hedef sol d\u00f6nm\u00fc\u015f yar\u0131da olmal\u0131\n    \n    return -1 # Hedef bulunamad\u0131\n\n# Vaka analizi \u00f6rnekleri:\nprint(f\"Dizi: [4, 5, 6, 7, 0, 1, 2], Hedef: 0 -> \u0130ndeks: {search_rotated_sorted_array([4, 5, 6, 7, 0, 1, 2], 0)}\") # \u00c7\u0131kt\u0131: 4\nprint(f\"Dizi: [4, 5, 6, 7, 0, 1, 2], Hedef: 3 -> \u0130ndeks: {search_rotated_sorted_array([4, 5, 6, 7, 0, 1, 2], 3)}\") # \u00c7\u0131kt\u0131: -1\nprint(f\"Dizi: [1], Hedef: 0 -> \u0130ndeks: {search_rotated_sorted_array([1], 0)}\") # \u00c7\u0131kt\u0131: -1\nprint(f\"Dizi: [1], Hedef: 1 -> \u0130ndeks: {search_rotated_sorted_array([1], 1)}\") # \u00c7\u0131kt\u0131: 0\nprint(f\"Dizi: [3, 1], Hedef: 1 -> \u0130ndeks: {search_rotated_sorted_array([3, 1], 1)}\") # \u00c7\u0131kt\u0131: 1\nprint(f\"Dizi: [5, 1, 3], Hedef: 3 -> \u0130ndeks: {search_rotated_sorted_array([5, 1, 3], 3)}\") # \u00c7\u0131kt\u0131: 2\n      <\/code><\/pre>\n<\/p><\/div>\n<p>Yukar\u0131daki kodda, <code>left<\/code> ve <code>right<\/code> i\u015faret\u00e7ileri dizinin ba\u015flang\u0131c\u0131n\u0131 ve sonunu temsil eder. <code>while left <= right<\/code> d\u00f6ng\u00fcs\u00fc, arama alan\u0131 bo\u015falana kadar devam eder. Her iterasyonda, <code>mid<\/code> eleman\u0131 hesaplan\u0131r. E\u011fer <code>nums[mid]<\/code> do\u011frudan hedefimize e\u015fitse, o eleman\u0131n indeksini d\u00f6nd\u00fcr\u00fcr\u00fcz. Aksi takdirde, dizinin sol yar\u0131s\u0131n\u0131n (<code>nums[left]<\/code>'ten <code>nums[mid]<\/code>'e kadar) veya sa\u011f yar\u0131s\u0131n\u0131n (<code>nums[mid]<\/code>'den <code>nums[right]<\/code>'a kadar) normal s\u0131ral\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol ederiz. Bu kontrol, <code>if nums[left] <= nums[mid]:<\/code> ko\u015fulu ile yap\u0131l\u0131r. E\u011fer bu ko\u015ful do\u011fruysa, sol yar\u0131m s\u0131ral\u0131d\u0131r. Bu durumda, hedef de\u011ferin bu s\u0131ral\u0131 sol yar\u0131da (<code>nums[left] <= target < nums[mid]<\/code>) olup olmad\u0131\u011f\u0131n\u0131 kontrol ederiz. E\u011fer hedef buradaysa, <code>right = mid - 1<\/code> yaparak arama alan\u0131n\u0131 sol yar\u0131ya daralt\u0131r\u0131z. De\u011filse, hedef sa\u011f (d\u00f6nm\u00fc\u015f) yar\u0131da olmal\u0131d\u0131r, bu y\u00fczden <code>left = mid + 1<\/code> yapar\u0131z. Ayn\u0131 mant\u0131k, sa\u011f yar\u0131n\u0131n s\u0131ral\u0131 oldu\u011fu durumda da uygulan\u0131r. Bu detayl\u0131 kar\u015f\u0131la\u015ft\u0131rmalar sayesinde, algoritmam\u0131z d\u00f6nm\u00fc\u015f dizinin karma\u015f\u0131k yap\u0131s\u0131nda bile do\u011fru arama yolunu bulabilir.<\/p>\n<h2>Ger\u00e7ek D\u00fcnya Uygulamalar\u0131 ve \u0130leri D\u00fczey Konular: Performans ve Optimizasyon<\/h2>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizide arama algoritmas\u0131, sadece akademik bir problem olmaktan \u00f6te, bir\u00e7ok ger\u00e7ek d\u00fcnya uygulamas\u0131nda kar\u015f\u0131la\u015f\u0131lan pratik bir ihtiyaca yan\u0131t verir. Bu b\u00f6l\u00fcmde, algoritman\u0131n nerelerde kullan\u0131labilece\u011fini ve performans\u0131n\u0131 etkileyen ileri d\u00fczey konular\u0131, \u00f6zellikle yinelenen de\u011ferlerin (duplicates) etkisini ve karma\u015f\u0131kl\u0131k analizini ele alaca\u011f\u0131z.<\/p>\n<h3>Veritaban\u0131 \u0130ndeksleme ve B\u00fcy\u00fck Veri K\u00fcmelerinde Kullan\u0131m<\/h3>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerdeki arama mant\u0131\u011f\u0131, \u00f6zellikle b\u00fcy\u00fck veri sistemlerinde ve veritaban\u0131 indeksleme mekanizmalar\u0131nda dolayl\u0131 olarak kar\u015f\u0131m\u0131za \u00e7\u0131kabilir. \u00d6rne\u011fin:<\/p>\n<ul>\n<li>\n            <strong>Veritaban\u0131 Sharding ve Da\u011f\u0131t\u0131k Sistemler:<\/strong> B\u00fcy\u00fck veritabanlar\u0131 genellikle birden fazla sunucuya (shard) b\u00f6l\u00fcn\u00fcr. Verilerin belirli bir anahtara g\u00f6re s\u0131ral\u0131 tutuldu\u011fu durumlarda, bir sunucudan di\u011ferine veri ta\u015f\u0131nmas\u0131 veya y\u00fck dengeleme i\u015flemleri s\u0131ras\u0131nda indeksler fiziksel olarak \"d\u00f6nebilir\". Bu durumda, bir sorgunun hangi shard'a y\u00f6nlendirilece\u011fini belirlemek i\u00e7in d\u00f6nm\u00fc\u015f dizi arama mant\u0131\u011f\u0131 kullan\u0131labilir. Bir shard'\u0131n anahtar aral\u0131\u011f\u0131 <code>[A, B]<\/code> iken, ba\u015fka bir shard'\u0131n aral\u0131\u011f\u0131 <code>[C, D]<\/code> olabilir ve bu aral\u0131klar genel bir s\u0131ral\u0131 dizinin d\u00f6nm\u00fc\u015f par\u00e7alar\u0131 gibi davranabilir.\n        <\/li>\n<li>\n            <strong>Log Dosyas\u0131 Analizi:<\/strong> S\u00fcrekli olarak g\u00fcncellenen ve belirli bir zaman damgas\u0131na g\u00f6re s\u0131ralanan log dosyalar\u0131, eski loglar\u0131n ar\u015fivlenmesi veya silinmesi gibi i\u015flemlerle \"d\u00f6nm\u00fc\u015f\" bir yap\u0131ya b\u00fcr\u00fcnebilir. Belirli bir zaman aral\u0131\u011f\u0131ndaki olaylar\u0131 aramak i\u00e7in bu algoritma h\u0131z sa\u011flayabilir.\n        <\/li>\n<li>\n            <strong>Co\u011frafi Veri Sistemleri:<\/strong> Harita uygulamalar\u0131nda, belirli bir b\u00f6lgedeki noktalar\u0131 veya ilgi alanlar\u0131n\u0131 (POI - Point of Interest) ararken, co\u011frafi koordinatlar \u00fczerinde tan\u0131mlanm\u0131\u015f s\u0131ral\u0131 veri yap\u0131lar\u0131, belirli optimizasyonlar veya veri ta\u015f\u0131malar\u0131 sonucunda d\u00f6nm\u00fc\u015f \u00f6zellikler g\u00f6sterebilir.\n        <\/li>\n<li>\n            <strong>Kriptografi ve Hashing:<\/strong> Baz\u0131 karma\u015f\u0131k hashing algoritmalar\u0131 veya anahtar y\u00f6netimi sistemleri, anahtarlar\u0131n belirli bir d\u00fczende tutuldu\u011fu ve d\u00f6nme \u00f6zelliklerinin ortaya \u00e7\u0131kabilece\u011fi i\u00e7 veri yap\u0131lar\u0131 kullanabilir. Bu t\u00fcr yap\u0131larda verimli arama, sistemin genel performans\u0131n\u0131 art\u0131r\u0131r.<\/li>\n<\/ul>\n<p>Bu senaryolarda, algoritmam\u0131z\u0131n sa\u011flad\u0131\u011f\u0131 <code>O(log n)<\/code> zaman karma\u015f\u0131kl\u0131\u011f\u0131, milyonlarca veya milyarlarca veri eleman\u0131na sahip k\u00fcmelerde bile arama s\u00fcrelerini kabul edilebilir seviyelere \u00e7ekerek kullan\u0131c\u0131 deneyimini ve sistemin yan\u0131t verme h\u0131z\u0131n\u0131 do\u011frudan etkiler.<\/p>\n<h3>Yinelenen De\u011ferlerin (Duplicates) Etkisi ve Performans Analizi<\/h3>\n<p>\u015eimdiye kadar ele ald\u0131\u011f\u0131m\u0131z senaryolarda, dizide yinelenen de\u011ferlerin (duplicate elements) olmad\u0131\u011f\u0131n\u0131 varsayd\u0131k. Ancak, ger\u00e7ek d\u00fcnya verilerinde bu durum nadiren ge\u00e7erlidir. Dizide yinelenen de\u011ferler oldu\u011funda, algoritmam\u0131z\u0131n performans\u0131 \u00fczerinde \u00f6nemli bir etkisi olabilir.<\/p>\n<p>\u00d6rne\u011fin, <code>[3, 1, 3, 3, 3]<\/code> gibi bir dizi ve <code>1<\/code> de\u011ferini arad\u0131\u011f\u0131m\u0131z\u0131 d\u00fc\u015f\u00fcnelim.<br \/>\n    <code>left=0 (3), right=4 (3)<\/code>. <code>mid=2 (3)<\/code>.<br \/>\n    <code>nums[mid] == target<\/code> de\u011fil.<br \/>\n    <code>nums[left] (3) == nums[mid] (3)<\/code> oldu\u011fu i\u00e7in, sol yar\u0131m s\u0131ral\u0131 gibi g\u00f6r\u00fcnse de, asl\u0131nda d\u00f6nme noktas\u0131 bu aral\u0131\u011f\u0131n i\u00e7inde olabilir ve <code>left<\/code> ile <code>mid<\/code> aras\u0131ndaki t\u00fcm elemanlar ayn\u0131 olabilir. Bu durumda, <code>nums[left] <= target < nums[mid]<\/code> kontrol\u00fc yan\u0131lt\u0131c\u0131 olabilir.<br \/>\n    Bu belirsizlik, <code>nums[left] == nums[mid] == nums[right]<\/code> gibi durumlarda daha da belirginle\u015fir. \u00d6rne\u011fin, <code>[1, 1, 1, 0, 1]<\/code> dizisinde <code>0<\/code>'\u0131 ararken, <code>left=0, right=4, mid=2 (1)<\/code>. <code>nums[left] == nums[mid]<\/code>. Bu durumda, hangi yar\u0131n\u0131n s\u0131ral\u0131 oldu\u011funu veya hedefi nerede arayaca\u011f\u0131m\u0131z\u0131 kesin olarak bilemeyiz. Bu belirsizli\u011fi \u00e7\u00f6zmek i\u00e7in, <code>nums[left] == nums[mid]<\/code> durumuyla kar\u015f\u0131la\u015f\u0131ld\u0131\u011f\u0131nda, basit\u00e7e <code>left<\/code> i\u015faret\u00e7isini bir art\u0131rarak (<code>left += 1<\/code>) veya <code>right<\/code> i\u015faret\u00e7isini bir azaltarak (<code>right -= 1<\/code>) yinelenen elemanlar\u0131 ge\u00e7mek zorunda kal\u0131r\u0131z. Bu, en k\u00f6t\u00fc durumda, algoritman\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131n\u0131 <code>O(log n)<\/code>'den <code>O(n)<\/code>'e \u00e7\u0131karabilir, \u00e7\u00fcnk\u00fc her ad\u0131mda sadece bir eleman atl\u0131yor olabiliriz, t\u0131pk\u0131 do\u011frusal arama gibi.<\/p>\n<p><strong>Zaman Karma\u015f\u0131kl\u0131\u011f\u0131 (Time Complexity):<\/strong><br \/>\n    *   <strong>En \u0130yi Durum:<\/strong> <code>O(1)<\/code>, hedef ilk denemede (orta eleman olarak) bulunur.<br \/>\n    *   <strong>Ortalama Durum:<\/strong> <code>O(log n)<\/code>, dizi d\u00f6nm\u00fc\u015f olsa bile her ad\u0131mda arama alan\u0131 yar\u0131ya iner.<br \/>\n    *   <strong>En K\u00f6t\u00fc Durum (Yinelenen De\u011ferlerle):<\/strong> <code>O(n)<\/code>, e\u011fer dizide \u00e7ok say\u0131da yinelenen de\u011fer varsa ve bu de\u011ferler d\u00f6nme noktas\u0131n\u0131 gizlerse. \u00d6rne\u011fin, <code>[1, 1, 1, 1, ..., 1, 0, 1]<\/code> gibi bir dizide <code>0<\/code>'\u0131 aramak i\u00e7in neredeyse t\u00fcm elemanlar\u0131 kontrol etmek gerekebilir.<\/p>\n<p><strong>Yer Karma\u015f\u0131kl\u0131\u011f\u0131 (Space Complexity):<\/strong><br \/>\n    *   Algoritma, arama i\u015flemi s\u0131ras\u0131nda sadece birka\u00e7 de\u011fi\u015fken (<code>left<\/code>, <code>right<\/code>, <code>mid<\/code>) kulland\u0131\u011f\u0131 i\u00e7in, yer karma\u015f\u0131kl\u0131\u011f\u0131 <code>O(1)<\/code>'dir. Bu da onu bellek a\u00e7\u0131s\u0131ndan olduk\u00e7a verimli bir \u00e7\u00f6z\u00fcm yapar.<\/p>\n<p>Sonu\u00e7 olarak, d\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizilerde de\u011fi\u015ftirilmi\u015f ikili arama, \u00e7o\u011fu durumda \u00fcst\u00fcn performans sunan g\u00fc\u00e7l\u00fc bir algoritmad\u0131r. Ancak, yinelenen de\u011ferlerin varl\u0131\u011f\u0131, algoritman\u0131n en k\u00f6t\u00fc durum performans\u0131n\u0131 etkileyebilecek \u00f6nemli bir fakt\u00f6rd\u00fcr ve bu t\u00fcr senaryolar\u0131 tasarlarken g\u00f6z \u00f6n\u00fcnde bulundurulmal\u0131d\u0131r.<\/p>\n<h2>Sonu\u00e7 ve S\u0131k\u00e7a Sorulan Sorular<\/h2>\n<h3>\u00d6zet ve Gelecek Perspektifi<\/h3>\n<p>Bu makalede, s\u0131ral\u0131 dizilerde arama yapman\u0131n temel y\u00f6ntemi olan ikili araman\u0131n, dizilerin \"d\u00f6nm\u00fc\u015f\" (rotated) oldu\u011fu \u00f6zel bir durumda nas\u0131l modifiye edilmesi gerekti\u011fini detayl\u0131 bir \u015fekilde inceledik. Geleneksel ikili araman\u0131n d\u00f6nm\u00fc\u015f dizilerde neden ba\u015far\u0131s\u0131z oldu\u011funu, d\u00f6nm\u00fc\u015f dizilerin benzersiz yap\u0131s\u0131n\u0131 ve bu yap\u0131n\u0131n nas\u0131l kullan\u0131labilece\u011fini \u00f6\u011frendik. Algoritman\u0131n ad\u0131m ad\u0131m mant\u0131\u011f\u0131n\u0131, hangi yar\u0131n\u0131n s\u0131ral\u0131 oldu\u011funu belirleme ve arama alan\u0131n\u0131 ak\u0131ll\u0131ca daraltma stratejilerini ele ald\u0131k. Ayr\u0131ca, bir envanter sistemi \u00f6rne\u011fi \u00fczerinden Python kodunu inceleyerek algoritmam\u0131z\u0131n pratik uygulamas\u0131n\u0131 g\u00f6rd\u00fck. Son olarak, veritaban\u0131 indeksleme ve da\u011f\u0131t\u0131k sistemler gibi ger\u00e7ek d\u00fcnya senaryolar\u0131nda bu algoritman\u0131n nas\u0131l kullan\u0131labilece\u011fini ve yinelenen de\u011ferlerin algoritma performans\u0131 \u00fczerindeki potansiyel etkisini de\u011ferlendirdik.<\/p>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizide arama problemi, algoritmik d\u00fc\u015f\u00fcnme yetene\u011fini geli\u015ftiren ve veri yap\u0131lar\u0131 \u00fczerindeki hakimiyeti art\u0131ran klasik bir problemdir. Bu algoritma, sadece teknik m\u00fclakatlarda de\u011fil, ayn\u0131 zamanda b\u00fcy\u00fck \u00f6l\u00e7ekli sistemlerde performans optimizasyonu i\u00e7in de kritik \u00f6neme sahiptir. Gelecekte, daha karma\u015f\u0131k veri yap\u0131lar\u0131 \u00fczerinde benzer \"d\u00f6nm\u00fc\u015f\" veya \"k\u0131smen s\u0131ral\u0131\" arama problemlerinin \u00e7\u00f6z\u00fcm\u00fc i\u00e7in bu temel mant\u0131k, adaptasyon yetene\u011fiyle birlikte yeni algoritmalar\u0131n kap\u0131s\u0131n\u0131 aralayacakt\u0131r. Algoritma ve veri yap\u0131lar\u0131 d\u00fcnyas\u0131nda, bu t\u00fcr temel prensipleri anlamak, daha yenilik\u00e7i ve verimli \u00e7\u00f6z\u00fcmler \u00fcretmenin anahtar\u0131d\u0131r.<\/p>\n<h3>S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\n<p><strong>1. D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizi nedir?<\/strong><\/p>\n<p>D\u00f6nm\u00fc\u015f s\u0131ral\u0131 dizi, asl\u0131nda s\u0131ral\u0131 olan bir dizinin belirli bir noktadan kesilip iki par\u00e7an\u0131n yer de\u011fi\u015ftirmesiyle olu\u015fan bir dizidir. \u00d6rne\u011fin, <code>[1, 2, 3, 4, 5]<\/code> dizisi d\u00f6nerek <code>[3, 4, 5, 1, 2]<\/code> halini alabilir. Dizinin her iki par\u00e7as\u0131 da kendi i\u00e7inde s\u0131ral\u0131d\u0131r, ancak genel s\u0131ralama bir \"d\u00f6nme noktas\u0131\" ile bozulur.<\/p>\n<p><strong>2. Neden geleneksel ikili arama d\u00f6nm\u00fc\u015f dizilerde \u00e7al\u0131\u015fmaz?<\/strong><\/p>\n<p>Geleneksel ikili arama, dizinin tek bir b\u00fct\u00fcn olarak s\u0131ral\u0131 oldu\u011fu varsay\u0131m\u0131na dayan\u0131r. D\u00f6nm\u00fc\u015f bir dizide bu varsay\u0131m ge\u00e7erli de\u011fildir \u00e7\u00fcnk\u00fc orta eleman, dizinin sol veya sa\u011f ucundan daha k\u00fc\u00e7\u00fck veya daha b\u00fcy\u00fck olabilir. Bu durum, algoritman\u0131n arama alan\u0131n\u0131 yanl\u0131\u015f y\u00f6ne daraltmas\u0131na neden olabilir, bu da hedefi bulamamas\u0131na veya yanl\u0131\u015f sonu\u00e7lar vermesine yol a\u00e7ar.<\/p>\n<p><strong>3. De\u011fi\u015ftirilmi\u015f ikili arama algoritmas\u0131n\u0131n ana fikri nedir?<\/strong><\/p>\n<p>De\u011fi\u015ftirilmi\u015f ikili arama algoritmas\u0131n\u0131n ana fikri, her ad\u0131mda dizinin hangi yar\u0131s\u0131n\u0131n (sol veya sa\u011f) normal bir \u015fekilde s\u0131ral\u0131 oldu\u011funu belirlemektir. Bu s\u0131ral\u0131 yar\u0131y\u0131 tespit ettikten sonra, aranan hedef de\u011ferin bu s\u0131ral\u0131 yar\u0131da olup olmad\u0131\u011f\u0131n\u0131 kontrol ederiz. E\u011fer hedef s\u0131ral\u0131 yar\u0131daysa, arama alan\u0131n\u0131 o yar\u0131ya daralt\u0131r\u0131z. Aksi takdirde, hedef di\u011fer (d\u00f6nm\u00fc\u015f) yar\u0131da olmal\u0131d\u0131r ve arama alan\u0131m\u0131z\u0131 o y\u00f6ne kayd\u0131r\u0131r\u0131z. Bu sayede, logaritmik zaman karma\u015f\u0131kl\u0131\u011f\u0131 korunur.<\/p>\n<p><strong>4. Algoritman\u0131n zaman ve yer karma\u015f\u0131kl\u0131\u011f\u0131 nedir?<\/strong><\/p>\n<p>Algoritman\u0131n ortalama zaman karma\u015f\u0131kl\u0131\u011f\u0131 <code>O(log n)<\/code>'dir, \u00e7\u00fcnk\u00fc her ad\u0131mda arama alan\u0131 yar\u0131ya indirilir. Ancak, dizide \u00e7ok say\u0131da yinelenen de\u011fer (duplicates) bulunmas\u0131 durumunda, en k\u00f6t\u00fc senaryoda zaman karma\u015f\u0131kl\u0131\u011f\u0131 <code>O(n)<\/code>'e kadar \u00e7\u0131kabilir. Yer karma\u015f\u0131kl\u0131\u011f\u0131 ise <code>O(1)<\/code>'dir, \u00e7\u00fcnk\u00fc algoritma sabit miktarda ek bellek kullan\u0131r (sadece birka\u00e7 de\u011fi\u015fken).<\/p>\n<p><strong>5. Bu algoritma ger\u00e7ek d\u00fcnyada nerede kullan\u0131l\u0131r?<\/strong><\/p>\n<p>Bu algoritma, veritaban\u0131 indeksleme, da\u011f\u0131t\u0131k sistemlerde veri bulma, log dosyas\u0131 analizi ve co\u011frafi bilgi sistemleri gibi alanlarda dolayl\u0131 olarak kullan\u0131labilir. \u00d6zellikle, b\u00fcy\u00fck veri k\u00fcmelerinin y\u00f6netildi\u011fi ve veri ta\u015f\u0131malar\u0131 veya optimizasyonlar nedeniyle s\u0131ral\u0131 yap\u0131lar\u0131n \"d\u00f6nebildi\u011fi\" senaryolarda, h\u0131zl\u0131 ve verimli arama ihtiyac\u0131n\u0131 kar\u015f\u0131lamak i\u00e7in bu mant\u0131k kritik \u00f6neme sahiptir.<\/p>\n<p>#Teknoloji #Algoritma #VeriYap\u0131lar\u0131 #\u0130kiliArama #Yaz\u0131l\u0131mGeli\u015ftirme<\/p>\n<div class=\"github-example-link\"><strong>\u00d6rnek kod:<\/strong> <a href=\"https:\/\/github.com\/fatihsoysalcom\/search-rotated-sorted-array-modified-binary-search\" target=\"_blank\" rel=\"noopener noreferrer\">github.com\/fatihsoysalcom\/search-rotated-sorted-array-modified-binary-search<\/a><\/div>\n","protected":false},"excerpt":{"rendered":"G\u00fcn\u00fcm\u00fcz\u00fcn h\u0131zla geli\u015fen yaz\u0131l\u0131m d\u00fcnyas\u0131nda, veri yap\u0131lar\u0131 ve algoritmalar, performansl\u0131 uygulamalar geli\u015ftirmenin temel ta\u015flar\u0131d\u0131r.","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1],"tags":[],"class_list":{"0":"post-42716","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v20.5 (Yoast SEO v25.3.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler - Kodlar\u0131n Gizemli D\u00fcnyas\u0131<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler\" \/>\n<meta property=\"og:description\" content=\"G\u00fcn\u00fcm\u00fcz\u00fcn h\u0131zla geli\u015fen yaz\u0131l\u0131m d\u00fcnyas\u0131nda, veri yap\u0131lar\u0131 ve algoritmalar, performansl\u0131 uygulamalar geli\u015ftirmenin temel ta\u015flar\u0131d\u0131r.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2026-06-20T18:04:18+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2026-06-20T18:04:34+00:00\" \/>\n<meta name=\"author\" content=\"Fatih Soysal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"Fatih Soysal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"7 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler\",\"datePublished\":\"2026-06-20T18:04:18+00:00\",\"dateModified\":\"2026-06-20T18:04:34+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\"},\"wordCount\":3677,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#respond\"]}],\"copyrightYear\":\"2026\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\",\"name\":\"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler - Kodlar\u0131n Gizemli D\u00fcnyas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2026-06-20T18:04:18+00:00\",\"dateModified\":\"2026-06-20T18:04:34+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/\",\"name\":\"Fatihsoysal.com\",\"description\":\"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim\",\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\",\"name\":\"Fatih Soysal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"contentUrl\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"width\":512,\"height\":512,\"caption\":\"Fatih Soysal\"},\"logo\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/","og_locale":"tr_TR","og_type":"article","og_title":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler","og_description":"G\u00fcn\u00fcm\u00fcz\u00fcn h\u0131zla geli\u015fen yaz\u0131l\u0131m d\u00fcnyas\u0131nda, veri yap\u0131lar\u0131 ve algoritmalar, performansl\u0131 uygulamalar geli\u015ftirmenin temel ta\u015flar\u0131d\u0131r.","og_url":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2026-06-20T18:04:18+00:00","article_modified_time":"2026-06-20T18:04:34+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"7 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler","datePublished":"2026-06-20T18:04:18+00:00","dateModified":"2026-06-20T18:04:34+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/"},"wordCount":3677,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#respond"]}],"copyrightYear":"2026","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/","url":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/","name":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2026-06-20T18:04:18+00:00","dateModified":"2026-06-20T18:04:34+00:00","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/donmus-sirali-dizilerde-arama-degistirilmis-ikili-arama-ile-verimli-cozumler\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"D\u00f6nm\u00fc\u015f S\u0131ral\u0131 Dizilerde Arama: De\u011fi\u015ftirilmi\u015f \u0130kili Arama ile Verimli \u00c7\u00f6z\u00fcmler"}]},{"@type":"WebSite","@id":"https:\/\/fatihsoysal.com\/blog\/#website","url":"https:\/\/fatihsoysal.com\/blog\/","name":"Fatihsoysal.com","description":"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim","publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1","name":"Fatih Soysal","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","contentUrl":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","width":512,"height":512,"caption":"Fatih Soysal"},"logo":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/"},"description":"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.","url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/"}]}},"yoast_meta":{"yoast_wpseo_title":"","yoast_wpseo_metadesc":"","yoast_wpseo_canonical":""},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/42716","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/comments?post=42716"}],"version-history":[{"count":1,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/42716\/revisions"}],"predecessor-version":[{"id":42717,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/42716\/revisions\/42717"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=42716"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=42716"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=42716"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}