{"id":15579,"date":"2025-03-19T02:00:19","date_gmt":"2025-03-18T23:00:19","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/"},"modified":"2025-03-19T02:00:19","modified_gmt":"2025-03-18T23:00:19","slug":"siralama-algoritmalari-merge-sort-ve-quick-sort","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/","title":{"rendered":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort"},"content":{"rendered":"<p><body><\/p>\n<p>S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort<\/p>\n<p>Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort&#8217;u detayl\u0131 olarak inceleyece\u011fiz.  Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z.  \u00d6ncelikle,  temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.<\/p>\n<h2>S\u0131ralama Algoritmalar\u0131 Nedir?<\/h2>\n<p>S\u0131ralama algoritmalar\u0131, verilerin belirli bir d\u00fczende s\u0131ralanmas\u0131n\u0131 sa\u011flayan algoritmalard\u0131r.  \u00d6rne\u011fin, bir say\u0131 dizisini k\u00fc\u00e7\u00fckten b\u00fcy\u00fc\u011fe veya bir kelime listesini alfabetik s\u0131raya g\u00f6re s\u0131ralamak i\u00e7in bu algoritmalardan yararlan\u0131r\u0131z.  S\u0131ralama algoritmalar\u0131n\u0131n verimlili\u011fi,  verilerin boyutuna ve algoritman\u0131n karma\u015f\u0131kl\u0131\u011f\u0131na ba\u011fl\u0131d\u0131r.  Baz\u0131 algoritmalar k\u00fc\u00e7\u00fck veri setlerinde h\u0131zl\u0131 \u00e7al\u0131\u015f\u0131rken, b\u00fcy\u00fck veri setlerinde performans d\u00fc\u015f\u00fc\u015f\u00fc ya\u015fayabilirler.<\/p>\n<h2>Merge Sort (Birle\u015ftirme S\u0131ralamas\u0131)<\/h2>\n<p>Merge Sort, \u201cb\u00f6l ve fethet\u201d (divide and conquer) yakla\u015f\u0131m\u0131n\u0131 kullanan etkili bir s\u0131ralama algoritmas\u0131d\u0131r.  Algoritma, diziyi s\u00fcrekli ikiye b\u00f6lerek, tek elemanl\u0131 alt diziler elde edene kadar devam eder. Ard\u0131ndan, bu alt dizileri birle\u015ftirerek, s\u0131ral\u0131 bir dizi olu\u015fturur.  Bu birle\u015ftirme i\u015flemi s\u0131ras\u0131nda, alt dizilerdeki elemanlar kar\u015f\u0131la\u015ft\u0131r\u0131larak, s\u0131ral\u0131 bir \u015fekilde birle\u015ftirilir. <\/p>\n<p><strong>Merge Sort&#8217;un Avantajlar\u0131:<\/strong><\/p>\n<ul>\n<li>Her zaman O(n log n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir, bu da b\u00fcy\u00fck veri setleri i\u00e7in olduk\u00e7a verimlidir.<\/li>\n<li>Kararl\u0131 bir s\u0131ralama algoritmas\u0131d\u0131r, yani e\u015fit de\u011ferlere sahip elemanlar\u0131n s\u0131ralamas\u0131n\u0131 de\u011fi\u015ftirmez.<\/li>\n<\/ul>\n<p><strong>Merge Sort&#8217;un Dezavantajlar\u0131:<\/strong><\/p>\n<ul>\n<li>Ekstra bellek gerektirir \u00e7\u00fcnk\u00fc birle\u015ftirme i\u015flemi i\u00e7in ek bir diziye ihtiya\u00e7 duyar.<\/li>\n<li>K\u00fc\u00e7\u00fck veri setlerinde di\u011fer baz\u0131 algoritmalara g\u00f6re daha yava\u015f olabilir.<\/li>\n<\/ul>\n<pre><code class=\"language-python\">\ndef merge_sort(arr):\n    if len(arr) &gt; 1:\n        mid = len(arr)\/\/2\n        L = arr[:mid]\n        R = arr[mid:]\n\n        merge_sort(L)\n        merge_sort(R)\n\n        i = j = k = 0\n\n        while i &lt; len(L) and j &lt; len(R):\n            if L[i] &lt; R[j]:\n                arr[k] = L[i]\n                i += 1\n            else:\n                arr[k] = R[j]\n                j += 1\n            k += 1\n\n        while i &lt; len(L):\n            arr[k] = L[i]\n            i += 1\n            k += 1\n\n        while j &lt; len(R):\n            arr[k] = R[j]\n            j += 1\n            k += 1\n<\/code><\/pre>\n<h2>Quick Sort (H\u0131zl\u0131 S\u0131ralama)<\/h2>\n<p>Quick Sort,  \u201cb\u00f6l ve fethet\u201d yakla\u015f\u0131m\u0131n\u0131 kullanan bir di\u011fer etkili s\u0131ralama algoritmas\u0131d\u0131r.  Bu algoritma, bir pivot eleman\u0131 se\u00e7erek ve diziyi pivot&#8217;tan k\u00fc\u00e7\u00fck ve b\u00fcy\u00fck elemanlar olmak \u00fczere iki alt diziye b\u00f6ler.  Sonras\u0131nda, bu alt diziler \u00fczerinde yinelemeli olarak ayn\u0131 i\u015flem uygulan\u0131r.  Pivot eleman\u0131n\u0131n se\u00e7imi, algoritman\u0131n performans\u0131n\u0131 \u00f6nemli \u00f6l\u00e7\u00fcde etkiler.  \u0130yi bir pivot se\u00e7imi, dengeli alt diziler olu\u015fturur ve algoritman\u0131n verimlili\u011fini art\u0131r\u0131r.<\/p>\n<p><strong>Quick Sort&#8217;un Avantajlar\u0131:<\/strong><\/p>\n<ul>\n<li>Ortalama olarak O(n log n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.<\/li>\n<li>Yerinde s\u0131ralama yapar, yani ek bellek kullanmaz.<\/li>\n<\/ul>\n<p><strong>Quick Sort&#8217;un Dezavantajlar\u0131:<\/strong><\/p>\n<ul>\n<li>En k\u00f6t\u00fc durumda O(n\u00b2) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahip olabilir (k\u00f6t\u00fc pivot se\u00e7imi durumunda).<\/li>\n<li>Kararl\u0131 bir s\u0131ralama algoritmas\u0131 de\u011fildir.<\/li>\n<\/ul>\n<pre><code class=\"language-python\">\ndef quick_sort(arr, low, high):\n    if low &lt; high:\n        pi = partition(arr, low, high)\n        quick_sort(arr, low, pi-1)\n        quick_sort(arr, pi+1, high)\n\ndef partition(arr, low, high):\n    i = (low-1)         \n    pivot = arr[high]    \n\n    for j in range(low, high):\n        if arr[j] &lt;= pivot:\n            i = i+1\n            arr[i], arr[j] = arr[j], arr[i]\n\n    arr[i+1], arr[high] = arr[high], arr[i+1]\n    return (i+1)\n<\/code><\/pre>\n<h2>Merge Sort ve Quick Sort Kar\u015f\u0131la\u015ft\u0131rmas\u0131<\/h2>\n<p>Hem Merge Sort hem de Quick Sort, b\u00fcy\u00fck veri setleri i\u00e7in olduk\u00e7a verimlidir.  Ancak, Quick Sort&#8217;un en k\u00f6t\u00fc durum performans\u0131, Merge Sort&#8217;a g\u00f6re daha k\u00f6t\u00fcd\u00fcr.  Merge Sort, her zaman O(n log n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahipken, Quick Sort, k\u00f6t\u00fc bir pivot se\u00e7imi durumunda O(n\u00b2) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahip olabilir.  Ayr\u0131ca, Merge Sort kararl\u0131 bir algoritma iken, Quick Sort kararl\u0131 de\u011fildir.  Dolay\u0131s\u0131yla, veri setinin boyutu ve kararl\u0131l\u0131k gereksinimi, hangi algoritman\u0131n kullan\u0131laca\u011f\u0131na karar vermede \u00f6nemli fakt\u00f6rlerdir.<\/p>\n<p>Umar\u0131m bu makale, Merge Sort ve Quick Sort algoritmalar\u0131n\u0131 anlaman\u0131za yard\u0131mc\u0131 olmu\u015ftur.  Daha fazla algoritma ve programlama konusunda i\u00e7erikler i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> adresini ziyaret edebilirsiniz.  Ayr\u0131ca, algoritmalar hakk\u0131nda daha fazla bilgi edinmek i\u00e7in <a href=\"https:\/\/dev.to\/atoms19\/algorithms-1-intro-to-sorting-algorithms-i9p\">bu kayna\u011f\u0131<\/a> inceleyebilirsiniz.<\/p>\n<h3>#Etiketler<\/h3>\n<p>Merge Sort, Quick Sort, S\u0131ralama Algoritmalar\u0131, Algoritma Analizi, B\u00f6l ve Fethet, Kararl\u0131l\u0131k, Zaman Karma\u015f\u0131kl\u0131\u011f\u0131, Veri Yap\u0131lar\u0131, Programlama, Bilgisayar Bilimleri, Fatih Soysal<\/p>\n<p><\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a&hellip;","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-15579","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>S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort<\/title>\n<meta name=\"description\" content=\"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort&#039;u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.\" \/>\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\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort\" \/>\n<meta property=\"og:description\" content=\"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort&#039;u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-03-18T23:00:19+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=\"4 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort\",\"datePublished\":\"2025-03-18T23:00:19+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\"},\"wordCount\":650,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\",\"name\":\"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-03-18T23:00:19+00:00\",\"description\":\"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort'u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort\"}]},{\"@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":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort","description":"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort'u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.","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\/siralama-algoritmalari-merge-sort-ve-quick-sort\/","og_locale":"tr_TR","og_type":"article","og_title":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort","og_description":"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort'u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.","og_url":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-03-18T23:00:19+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"4 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort","datePublished":"2025-03-18T23:00:19+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/"},"wordCount":650,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/","url":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/","name":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-03-18T23:00:19+00:00","description":"Merhaba! Bug\u00fcn, programlaman\u0131n temel ta\u015flar\u0131ndan biri olan s\u0131ralama algoritmalar\u0131 aras\u0131nda olduk\u00e7a pop\u00fcler olan iki algoritmay\u0131, Merge Sort ve Quick Sort'u detayl\u0131 olarak inceleyece\u011fiz. Bu algoritmalar\u0131n \u00e7al\u0131\u015fma prensiplerini, performanslar\u0131n\u0131 ve birbirlerine g\u00f6re avantajlar\u0131n\u0131 ve dezavantajlar\u0131n\u0131 ele alaca\u011f\u0131z. \u00d6ncelikle, temel kavramlar\u0131 hat\u0131rlayarak ba\u015flayal\u0131m.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/siralama-algoritmalari-merge-sort-ve-quick-sort\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"S\u0131ralama Algoritmalar\u0131: Merge Sort ve Quick Sort"}]},{"@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\/15579","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=15579"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/15579\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=15579"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=15579"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=15579"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}