Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/title><br \/>\n<\/head><br \/>\n<body><\/p>\n<p>Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/p>\n<p>Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort’u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.<\/p>\n<h2>Insertion Sort Mant\u0131\u011f\u0131<\/h2>\n<p>Insertion Sort, bir kart destesi s\u0131ralarken kulland\u0131\u011f\u0131m\u0131z y\u00f6nteme benzer \u015fekilde \u00e7al\u0131\u015f\u0131r. Elimizde s\u0131ralanmam\u0131\u015f bir dizi eleman\u0131m\u0131z oldu\u011funu d\u00fc\u015f\u00fcnelim. Algoritma, her bir eleman\u0131 al\u0131r ve bu eleman\u0131n do\u011fru s\u0131ralanm\u0131\u015f konumunu bulmak i\u00e7in \u00f6n\u00fcndeki s\u0131ral\u0131 k\u0131s\u0131mda yerini arar. Bunu yaparken, daha b\u00fcy\u00fck elemanlar\u0131 birer birer bir ad\u0131m sa\u011fa kayd\u0131rarak yer a\u00e7ar ve ard\u0131ndan eleman\u0131 do\u011fru yerine yerle\u015ftirir.<\/p>\n<p>\u00d6rne\u011fin, [5, 2, 4, 6, 1, 3] dizisini ele alal\u0131m. Algoritma \u015fu \u015fekilde ilerler:<\/p>\n<ol>\n<li>[5] – \u0130lk eleman zaten s\u0131ral\u0131.<\/li>\n<li>[2, 5] – 2, 5’ten k\u00fc\u00e7\u00fck oldu\u011fu i\u00e7in 5 bir ad\u0131m sa\u011fa kayd\u0131r\u0131l\u0131r ve 2 ba\u015fa yerle\u015ftirilir. S\u0131ral\u0131 dizi: [2, 5]<\/li>\n<li>[2, 4, 5] – 4, 5’ten k\u00fc\u00e7\u00fck, ancak 2’den b\u00fcy\u00fck. Dolay\u0131s\u0131yla 5 sa\u011fa kayd\u0131r\u0131l\u0131r ve 4, 2’nin yan\u0131na yerle\u015ftirilir. S\u0131ral\u0131 dizi: [2, 4, 5]<\/li>\n<li>[2, 4, 5, 6] – 6 zaten en b\u00fcy\u00fck, dolay\u0131s\u0131yla s\u0131raya eklenir. S\u0131ral\u0131 dizi: [2, 4, 5, 6]<\/li>\n<li>[1, 2, 4, 5, 6] – 1, hepsinden k\u00fc\u00e7\u00fck oldu\u011fu i\u00e7in ba\u015fa yerle\u015ftirilir. S\u0131ral\u0131 dizi: [1, 2, 4, 5, 6]<\/li>\n<li>[1, 2, 3, 4, 5, 6] – 3, 4’ten k\u00fc\u00e7\u00fck, 2’den b\u00fcy\u00fck oldu\u011fu i\u00e7in 4 sa\u011fa kayd\u0131r\u0131l\u0131r ve 3 do\u011fru yerine yerle\u015ftirilir. S\u0131ral\u0131 dizi: [1, 2, 3, 4, 5, 6]<\/li>\n<\/ol>\n<p>Sonu\u00e7 olarak, dizi tamamen s\u0131ralanm\u0131\u015f olur.<\/p>\n<h2>Kod \u00d6rne\u011fi (Python)<\/h2>\n<pre><code>\ndef insertion_sort(dizi):\n for i in range(1, len(dizi)):\n anahtar = dizi[i]\n j = i-1\n while j >= 0 and anahtar < dizi[j]:\n dizi[j+1] = dizi[j]\n j -= 1\n dizi[j+1] = anahtar\n return dizi\n\ndizi = [5, 2, 4, 6, 1, 3]\nsirali_dizi = insertion_sort(dizi)\nprint(f\"S\u0131ralanm\u0131\u015f dizi: {sirali_dizi}\")\n<\/code><\/pre>\n<h2>Performans Analizi<\/h2>\n<p>Insertion Sort'un zaman karma\u015f\u0131kl\u0131\u011f\u0131, en k\u00f6t\u00fc ve ortalama durumlarda O(n\u00b2) iken, en iyi durumda (zaten s\u0131ral\u0131 bir dizi) O(n)'dir. Bu nedenle, b\u00fcy\u00fck veri k\u00fcmeleri i\u00e7in pek uygun de\u011fildir. Ancak, k\u00fc\u00e7\u00fck veri k\u00fcmeleri veya neredeyse s\u0131ral\u0131 diziler i\u00e7in olduk\u00e7a etkilidir. Ayr\u0131ca, yerinde s\u0131ralama (in-place sorting) algoritmas\u0131 oldu\u011fundan, ekstra bellek kullan\u0131m\u0131 gerektirmez.<\/p>\n<p>Daha fazla algoritma ve yaz\u0131l\u0131m geli\u015ftirme konular\u0131nda bilgi edinmek i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">web sitemi<\/a> ziyaret edebilirsiniz.<\/p>\n<p>Bu konuda faydal\u0131 bulabilece\u011finiz ba\u015fka bir kaynak: <a href=\"https:\/\/www.geeksforgeeks.org\/insertion-sort\/\">GeeksforGeeks Insertion Sort<\/a><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\" alt=\"Insertion Sort G\u00f6rseli\" width=\"500\"><\/p>\n<p>Umar\u0131m bu makale size Insertion Sort algoritmas\u0131n\u0131 daha iyi anlaman\u0131za yard\u0131mc\u0131 olmu\u015ftur. Herhangi bir sorunuz varsa l\u00fctfen bana ula\u015fmaktan \u00e7ekinmeyin.<\/p>\n<p>#Etiketler: Insertion Sort, S\u0131ralama Algoritmalar\u0131, Python, Zaman Karma\u015f\u0131kl\u0131\u011f\u0131, Algoritma Analizi, Veri Yap\u0131lar\u0131, Programlama<\/p>\n<p><\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler Merhaba! Fatih Soysal olarak, bug\u00fcn size…","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-4161","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n<title>Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/title>\n<meta name=\"description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\" \/>\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\/insertion-sort-detayli-anlatim-ve-ornekler\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\" \/>\n<meta property=\"og:description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-17T20:45:13+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\" \/>\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=\"2 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\",\"datePublished\":\"2024-11-17T20:45:13+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"},\"wordCount\":452,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"image\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#respond\"]}],\"copyrightYear\":\"2024\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\",\"name\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"datePublished\":\"2024-11-17T20:45:13+00:00\",\"description\":\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\",\"url\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"contentUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\"}]},{\"@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_head_json":{"title":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","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\/insertion-sort-detayli-anlatim-ve-ornekler\/","og_locale":"tr_TR","og_type":"article","og_title":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","og_description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","og_url":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2024-11-17T20:45:13+00:00","og_image":[{"url":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","type":"","width":"","height":""}],"author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"2 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","datePublished":"2024-11-17T20:45:13+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"},"wordCount":452,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"image":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"thumbnailUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#respond"]}],"copyrightYear":"2024","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","url":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","name":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"image":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"thumbnailUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","datePublished":"2024-11-17T20:45:13+00:00","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"]}]},{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage","url":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","contentUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png"},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler"}]},{"@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\/4161","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=4161"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/4161\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=4161"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=4161"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=4161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":4161,"date":"2024-11-17T23:45:13","date_gmt":"2024-11-17T20:45:13","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"},"modified":"2024-11-17T23:45:13","modified_gmt":"2024-11-17T20:45:13","slug":"insertion-sort-detayli-anlatim-ve-ornekler","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","title":{"rendered":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler"},"content":{"rendered":"

\n
\n
\n
\n Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/title><br \/>\n<\/head><br \/>\n<body><\/p>\n<p>Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/p>\n<p>Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort’u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.<\/p>\n<h2>Insertion Sort Mant\u0131\u011f\u0131<\/h2>\n<p>Insertion Sort, bir kart destesi s\u0131ralarken kulland\u0131\u011f\u0131m\u0131z y\u00f6nteme benzer \u015fekilde \u00e7al\u0131\u015f\u0131r. Elimizde s\u0131ralanmam\u0131\u015f bir dizi eleman\u0131m\u0131z oldu\u011funu d\u00fc\u015f\u00fcnelim. Algoritma, her bir eleman\u0131 al\u0131r ve bu eleman\u0131n do\u011fru s\u0131ralanm\u0131\u015f konumunu bulmak i\u00e7in \u00f6n\u00fcndeki s\u0131ral\u0131 k\u0131s\u0131mda yerini arar. Bunu yaparken, daha b\u00fcy\u00fck elemanlar\u0131 birer birer bir ad\u0131m sa\u011fa kayd\u0131rarak yer a\u00e7ar ve ard\u0131ndan eleman\u0131 do\u011fru yerine yerle\u015ftirir.<\/p>\n<p>\u00d6rne\u011fin, [5, 2, 4, 6, 1, 3] dizisini ele alal\u0131m. Algoritma \u015fu \u015fekilde ilerler:<\/p>\n<ol>\n<li>[5] – \u0130lk eleman zaten s\u0131ral\u0131.<\/li>\n<li>[2, 5] – 2, 5’ten k\u00fc\u00e7\u00fck oldu\u011fu i\u00e7in 5 bir ad\u0131m sa\u011fa kayd\u0131r\u0131l\u0131r ve 2 ba\u015fa yerle\u015ftirilir. S\u0131ral\u0131 dizi: [2, 5]<\/li>\n<li>[2, 4, 5] – 4, 5’ten k\u00fc\u00e7\u00fck, ancak 2’den b\u00fcy\u00fck. Dolay\u0131s\u0131yla 5 sa\u011fa kayd\u0131r\u0131l\u0131r ve 4, 2’nin yan\u0131na yerle\u015ftirilir. S\u0131ral\u0131 dizi: [2, 4, 5]<\/li>\n<li>[2, 4, 5, 6] – 6 zaten en b\u00fcy\u00fck, dolay\u0131s\u0131yla s\u0131raya eklenir. S\u0131ral\u0131 dizi: [2, 4, 5, 6]<\/li>\n<li>[1, 2, 4, 5, 6] – 1, hepsinden k\u00fc\u00e7\u00fck oldu\u011fu i\u00e7in ba\u015fa yerle\u015ftirilir. S\u0131ral\u0131 dizi: [1, 2, 4, 5, 6]<\/li>\n<li>[1, 2, 3, 4, 5, 6] – 3, 4’ten k\u00fc\u00e7\u00fck, 2’den b\u00fcy\u00fck oldu\u011fu i\u00e7in 4 sa\u011fa kayd\u0131r\u0131l\u0131r ve 3 do\u011fru yerine yerle\u015ftirilir. S\u0131ral\u0131 dizi: [1, 2, 3, 4, 5, 6]<\/li>\n<\/ol>\n<p>Sonu\u00e7 olarak, dizi tamamen s\u0131ralanm\u0131\u015f olur.<\/p>\n<h2>Kod \u00d6rne\u011fi (Python)<\/h2>\n<pre><code>\ndef insertion_sort(dizi):\n for i in range(1, len(dizi)):\n anahtar = dizi[i]\n j = i-1\n while j >= 0 and anahtar < dizi[j]:\n dizi[j+1] = dizi[j]\n j -= 1\n dizi[j+1] = anahtar\n return dizi\n\ndizi = [5, 2, 4, 6, 1, 3]\nsirali_dizi = insertion_sort(dizi)\nprint(f\"S\u0131ralanm\u0131\u015f dizi: {sirali_dizi}\")\n<\/code><\/pre>\n<h2>Performans Analizi<\/h2>\n<p>Insertion Sort'un zaman karma\u015f\u0131kl\u0131\u011f\u0131, en k\u00f6t\u00fc ve ortalama durumlarda O(n\u00b2) iken, en iyi durumda (zaten s\u0131ral\u0131 bir dizi) O(n)'dir. Bu nedenle, b\u00fcy\u00fck veri k\u00fcmeleri i\u00e7in pek uygun de\u011fildir. Ancak, k\u00fc\u00e7\u00fck veri k\u00fcmeleri veya neredeyse s\u0131ral\u0131 diziler i\u00e7in olduk\u00e7a etkilidir. Ayr\u0131ca, yerinde s\u0131ralama (in-place sorting) algoritmas\u0131 oldu\u011fundan, ekstra bellek kullan\u0131m\u0131 gerektirmez.<\/p>\n<p>Daha fazla algoritma ve yaz\u0131l\u0131m geli\u015ftirme konular\u0131nda bilgi edinmek i\u00e7in <a href=\"https:\/\/fatihsoysal.com\">web sitemi<\/a> ziyaret edebilirsiniz.<\/p>\n<p>Bu konuda faydal\u0131 bulabilece\u011finiz ba\u015fka bir kaynak: <a href=\"https:\/\/www.geeksforgeeks.org\/insertion-sort\/\">GeeksforGeeks Insertion Sort<\/a><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\" alt=\"Insertion Sort G\u00f6rseli\" width=\"500\"><\/p>\n<p>Umar\u0131m bu makale size Insertion Sort algoritmas\u0131n\u0131 daha iyi anlaman\u0131za yard\u0131mc\u0131 olmu\u015ftur. Herhangi bir sorunuz varsa l\u00fctfen bana ula\u015fmaktan \u00e7ekinmeyin.<\/p>\n<p>#Etiketler: Insertion Sort, S\u0131ralama Algoritmalar\u0131, Python, Zaman Karma\u015f\u0131kl\u0131\u011f\u0131, Algoritma Analizi, Veri Yap\u0131lar\u0131, Programlama<\/p>\n<p><\/body><br \/>\n<\/html><\/p>\n","protected":false},"excerpt":{"rendered":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler Merhaba! Fatih Soysal olarak, bug\u00fcn size…","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-4161","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n<title>Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler<\/title>\n<meta name=\"description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\" \/>\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\/insertion-sort-detayli-anlatim-ve-ornekler\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\" \/>\n<meta property=\"og:description\" content=\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-17T20:45:13+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\" \/>\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=\"2 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\",\"datePublished\":\"2024-11-17T20:45:13+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"},\"wordCount\":452,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"image\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#respond\"]}],\"copyrightYear\":\"2024\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\",\"name\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"datePublished\":\"2024-11-17T20:45:13+00:00\",\"description\":\"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage\",\"url\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\",\"contentUrl\":\"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler\"}]},{\"@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_head_json":{"title":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","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\/insertion-sort-detayli-anlatim-ve-ornekler\/","og_locale":"tr_TR","og_type":"article","og_title":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","og_description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","og_url":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2024-11-17T20:45:13+00:00","og_image":[{"url":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","type":"","width":"","height":""}],"author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"2 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","datePublished":"2024-11-17T20:45:13+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"},"wordCount":452,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"image":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"thumbnailUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#respond"]}],"copyrightYear":"2024","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","url":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/","name":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"image":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage"},"thumbnailUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","datePublished":"2024-11-17T20:45:13+00:00","description":"Merhaba! Fatih Soysal olarak, bug\u00fcn size olduk\u00e7a yayg\u0131n ve anla\u015f\u0131l\u0131r bir s\u0131ralama algoritmas\u0131 olan Insertion Sort'u detayl\u0131 bir \u015fekilde anlataca\u011f\u0131m. Bu algoritma, \u00f6zellikle k\u00fc\u00e7\u00fck veri k\u00fcmeleri i\u00e7in olduk\u00e7a etkilidir ve \u00f6\u011frenmesi kolayd\u0131r. \u00d6ncelikle algoritman\u0131n mant\u0131\u011f\u0131n\u0131 kavrayal\u0131m, ard\u0131ndan kod \u00f6rnekleri ve performans analizine ge\u00e7ece\u011fiz.","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/"]}]},{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#primaryimage","url":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png","contentUrl":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/0\/0f\/Insertion-sort-diagram.svg\/1280px-Insertion-sort-diagram.svg.png"},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/insertion-sort-detayli-anlatim-ve-ornekler\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Insertion Sort: Detayl\u0131 Anlat\u0131m ve \u00d6rnekler"}]},{"@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\/4161","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=4161"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/4161\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=4161"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=4161"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=4161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}