{"id":16834,"date":"2025-04-01T04:15:14","date_gmt":"2025-04-01T01:15:14","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/"},"modified":"2025-04-01T04:15:14","modified_gmt":"2025-04-01T01:15:14","slug":"yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/","title":{"rendered":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131"},"content":{"rendered":"<p><body><\/p>\n<p>Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131<\/p>\n<p>Merhaba!  Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m.  Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r.  Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir.  Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur.  Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r.  \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.<\/p>\n<h2>Y\u0131\u011f\u0131n (Heap) Nedir?<\/h2>\n<p>Bir y\u0131\u011f\u0131n, \u00f6zel bir ikili a\u011fa\u00e7t\u0131r.  Bu a\u011fa\u00e7ta, her d\u00fc\u011f\u00fcm\u00fcn de\u011feri, \u00e7ocuk d\u00fc\u011f\u00fcmlerinin de\u011ferlerinden b\u00fcy\u00fck veya e\u015fittir (maksimum y\u0131\u011f\u0131n) veya k\u00fc\u00e7\u00fck veya e\u015fittir (minimum y\u0131\u011f\u0131n).  Y\u0131\u011f\u0131n, genellikle bir dizi ile temsil edilir.  Bu sayede, y\u0131\u011f\u0131n\u0131n elemanlar\u0131na h\u0131zl\u0131 bir \u015fekilde eri\u015filebilir.  Y\u0131\u011f\u0131n s\u0131ralamas\u0131nda maksimum y\u0131\u011f\u0131n kullan\u0131l\u0131r.  Yani, dizinin ilk eleman\u0131 (k\u00f6k) her zaman dizideki en b\u00fcy\u00fck elemand\u0131r.<\/p>\n<h2>Heapify \u0130\u015flemi<\/h2>\n<p>Heapify i\u015flemi, bir ikili a\u011fac\u0131 y\u0131\u011f\u0131n yap\u0131s\u0131na d\u00f6n\u00fc\u015ft\u00fcrmek i\u00e7in kullan\u0131l\u0131r.  Bu i\u015flem, a\u011fac\u0131n alt dallar\u0131ndan ba\u015flayarak yukar\u0131 do\u011fru yap\u0131l\u0131r.  Her d\u00fc\u011f\u00fcm i\u00e7in, d\u00fc\u011f\u00fcm\u00fcn de\u011feri \u00e7ocuk d\u00fc\u011f\u00fcmlerinin de\u011ferleriyle kar\u015f\u0131la\u015ft\u0131r\u0131l\u0131r.  E\u011fer d\u00fc\u011f\u00fcm\u00fcn de\u011feri \u00e7ocuk d\u00fc\u011f\u00fcmlerinin de\u011ferlerinden k\u00fc\u00e7\u00fckse, d\u00fc\u011f\u00fcm\u00fcn de\u011feri \u00e7ocuk d\u00fc\u011f\u00fcmlerinden biriyle yer de\u011fi\u015ftirilir. Bu i\u015flem, a\u011fac\u0131n k\u00f6k d\u00fc\u011f\u00fcm\u00fcne ula\u015fana kadar tekrarlan\u0131r. Sonu\u00e7 olarak, a\u011fa\u00e7 bir y\u0131\u011f\u0131n haline gelir ve en b\u00fcy\u00fck eleman k\u00f6kte bulunur.<\/p>\n<p>\u00d6rne\u011fin, \u015fu diziyi ele alal\u0131m: [1, 12, 9, 5, 6, 10]. Bu diziyi y\u0131\u011f\u0131n yap\u0131s\u0131na d\u00f6n\u00fc\u015ft\u00fcrmek i\u00e7in heapify i\u015flemi uygulan\u0131r.  Bu i\u015flem sonucunda dizi [12, 10, 9, 5, 6, 1] gibi bir yap\u0131ya d\u00f6n\u00fc\u015fecektir.  Burada 12, yani en b\u00fcy\u00fck eleman k\u00f6kte yer almaktad\u0131r.<\/p>\n<h2>Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131<\/h2>\n<p>Y\u0131\u011f\u0131n s\u0131ralamas\u0131 algoritmas\u0131, \u00f6ncelikle girilen diziyi bir maksimum y\u0131\u011f\u0131na d\u00f6n\u00fc\u015ft\u00fcrerek \u00e7al\u0131\u015f\u0131r.  Daha sonra, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck eleman\u0131 (k\u00f6k) ile y\u0131\u011f\u0131n\u0131n son eleman\u0131 yer de\u011fi\u015ftirilir.  Y\u0131\u011f\u0131n\u0131n boyutu bir azalt\u0131l\u0131r ve kalan y\u0131\u011f\u0131n tekrar y\u0131\u011f\u0131n yap\u0131s\u0131na d\u00f6n\u00fc\u015ft\u00fcr\u00fcl\u00fcr. Bu i\u015flem, y\u0131\u011f\u0131n\u0131n boyutu s\u0131f\u0131ra ula\u015fana kadar tekrarlan\u0131r.  Sonu\u00e7 olarak, dizi s\u0131ralanm\u0131\u015f olur.<\/p>\n<p>Bu algoritman\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131 O(n log n)&#8217;dir.  Bu, algoritman\u0131n b\u00fcy\u00fck veri setleri i\u00e7in de olduk\u00e7a verimli oldu\u011fu anlam\u0131na gelir.  Ayr\u0131ca, algoritma yerinde (in-place) s\u0131ralama yapar, yani ekstra bellek kullanmaz. Bu da onu daha da verimli k\u0131lar.<\/p>\n<h3>Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Kod \u00d6rne\u011fi (Python):<\/h3>\n<pre><code>\ndef heapify(arr, n, i):\n    largest = i\n    l = 2 * i + 1\n    r = 2 * i + 2\n\n    if l < n and arr[i] < arr[l]:\n        largest = l\n\n    if r < n and arr[largest] < arr[r]:\n        largest = r\n\n    if largest != i:\n        arr[i], arr[largest] = arr[largest], arr[i]\n        heapify(arr, n, largest)\n\ndef heapSort(arr):\n    n = len(arr)\n\n    for i in range(n \/\/ 2 - 1, -1, -1):\n        heapify(arr, n, i)\n\n    for i in range(n - 1, 0, -1):\n        arr[i], arr[0] = arr[0], arr[i]\n        heapify(arr, i, 0)\n\n# \u00d6rnek kullan\u0131m\narr = [12, 11, 13, 5, 6, 7]\nheapSort(arr)\nprint(\"S\u0131ralanm\u0131\u015f dizi:\", arr)\n<\/code><\/pre>\n<p>Bu kod, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131 ad\u0131m ad\u0131m g\u00f6stermektedir.  \u00d6ncelikle heapify fonksiyonu, y\u0131\u011f\u0131n yap\u0131s\u0131n\u0131 olu\u015fturur.  Sonras\u0131nda heapSort fonksiyonu, y\u0131\u011f\u0131n yap\u0131s\u0131n\u0131 kullanarak s\u0131ralamay\u0131 ger\u00e7ekle\u015ftirir.<\/p>\n<p>Y\u0131\u011f\u0131n s\u0131ralamas\u0131, \u00f6zellikle b\u00fcy\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkili bir algoritmad\u0131r.  Ancak, baz\u0131 durumlarda, di\u011fer s\u0131ralama algoritmalar\u0131 daha h\u0131zl\u0131 olabilir.  Dolay\u0131s\u0131yla, hangi algoritman\u0131n kullan\u0131laca\u011f\u0131, veri setinin b\u00fcy\u00fckl\u00fc\u011f\u00fcne ve \u00f6zelliklerine ba\u011fl\u0131d\u0131r.  Daha fazla bilgi i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">fatihsoysal.com<\/a> adresini ziyaret edebilirsiniz.<\/p>\n<p>Ayr\u0131ca,  konu hakk\u0131nda daha fazla bilgi edinmek i\u00e7in <a href=\"https:\/\/www.geeksforgeeks.org\/heap-sort\/\">GeeksforGeeks<\/a>  ve  <a href=\"https:\/\/en.wikipedia.org\/wiki\/Heapsort\">Wikipedia<\/a> kaynaklar\u0131na g\u00f6z atabilirsiniz.<\/p>\n<p>#Etiketler: Y\u0131\u011f\u0131n S\u0131ralamas\u0131, Heap Sort, Heapify, Heap A\u011fac\u0131, Veri Yap\u0131lar\u0131, Algoritmalar, DSA, Ba\u015flang\u0131\u00e7 Seviyesi, Programlama, Python<br \/>\n<\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131 Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama&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-16834","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>Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131<\/title>\n<meta name=\"description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.\" \/>\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\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131\" \/>\n<meta property=\"og:description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-04-01T01:15:14+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\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131\",\"datePublished\":\"2025-04-01T01:15:14+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\"},\"wordCount\":690,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\",\"name\":\"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-04-01T01:15:14+00:00\",\"description\":\"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131\"}]},{\"@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":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.","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\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/","og_locale":"tr_TR","og_type":"article","og_title":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131","og_description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.","og_url":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-04-01T01:15:14+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\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131","datePublished":"2025-04-01T01:15:14+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/"},"wordCount":690,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/","url":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/","name":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-04-01T01:15:14+00:00","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size verimli ve etkili bir s\u0131ralama algoritmas\u0131 olan Y\u0131\u011f\u0131n S\u0131ralamas\u0131 (Heap Sort) algoritmas\u0131n\u0131 detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6ncelikle verileri bir y\u0131\u011f\u0131n (heap) veri yap\u0131s\u0131 i\u00e7inde d\u00fczenleyerek \u00e7al\u0131\u015f\u0131r. Y\u0131\u011f\u0131nlar, \u00f6zel bir ikili a\u011fa\u00e7 yap\u0131s\u0131yla temsil edilir ve belirli \u00f6zelliklere sahiptir. Bu \u00f6zellikler sayesinde, y\u0131\u011f\u0131n\u0131n en b\u00fcy\u00fck (veya en k\u00fc\u00e7\u00fck) eleman\u0131 her zaman k\u00f6kte bulunur. Bu \u00f6zellik, algoritman\u0131n verimlili\u011fini art\u0131r\u0131r. \u00d6ncelikle y\u0131\u011f\u0131n (heap) ve heapify i\u015flemini a\u00e7\u0131klayal\u0131m. Ard\u0131ndan, y\u0131\u011f\u0131n s\u0131ralamas\u0131n\u0131n nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131na detayl\u0131 olarak bakaca\u011f\u0131z.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/yigin-siralamasi-algoritmasi-heapify-ve-heap-agaci\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Y\u0131\u011f\u0131n S\u0131ralamas\u0131 Algoritmas\u0131: Heapify ve Heap A\u011fac\u0131"}]},{"@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\/16834","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=16834"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/16834\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=16834"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=16834"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=16834"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}