{"id":35098,"date":"2024-11-01T09:35:27","date_gmt":"2024-11-01T09:35:27","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=35098"},"modified":"2024-11-01T12:44:27","modified_gmt":"2024-11-01T12:44:27","slug":"%ec%bd%94%ed%8b%80%eb%a6%b0-%ec%bd%94%eb%94%a9%ed%85%8c%ec%8a%a4%ed%8a%b8-%ea%b0%95%ec%a2%8c-binary-search","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/35098\/","title":{"rendered":"Kotlin coding test course, binary search"},"content":{"rendered":"<p>Hello! In this course, we will explore the <strong>binary search<\/strong> algorithm, which commonly appears in job-related algorithm tests, and I will explain in detail how to solve problems using Kotlin. Binary search is an efficient algorithm for finding a specific value in a sorted array, with a time complexity of O(log n). In this course, we will solve problems using binary search and cover the problem-solving process in detail.<\/p>\n<h2>Problem Description<\/h2>\n<pre><code>\nProblem: Given a sorted array and a specific value, find the index of that value. \nIf the value does not exist in the array, it should return -1.\n\nInput:\n- arr: a sorted array of integers in ascending order\n- target: the integer to be searched for\n\nOutput:\n- The index of target (or -1 if it does not exist)\n<\/code><\/pre>\n<h3>Input Example<\/h3>\n<pre><code>\narr = [1, 2, 3, 4, 5, 6, 7, 8, 9]\ntarget = 5\n<\/code><\/pre>\n<h3>Output Example<\/h3>\n<pre><code>\n4\n<\/code><\/pre>\n<h2>Overview of the Binary Search Algorithm<\/h2>\n<p>\nThe binary search algorithm reduces the search range by splitting it into two branches based on conditions. The most common implementation of binary search includes the following steps.\n<\/p>\n<ol>\n<li>Define the starting index and the ending index of the array.<\/li>\n<li>Calculate the middle index.<\/li>\n<li>Compare the middle value with the target value.<\/li>\n<li>If the middle value is greater than the target, search the left half; if it is smaller, search the right half.<\/li>\n<li>Repeat until the value is found or the search range becomes empty.<\/li>\n<\/ol>\n<h2>Kotlin Implementation<\/h2>\n<p>Now let&#8217;s implement binary search using Kotlin.<\/p>\n<pre><code>\nfun binarySearch(arr: IntArray, target: Int): Int {\n    var left = 0\n    var right = arr.size - 1\n\n    while (left &lt;= right) {\n        val mid = left + (right - left) \/ 2\n\n        if (arr[mid] == target) {\n            return mid \/\/ return index if found\n        } else if (arr[mid] &lt; target) {\n            left = mid + 1 \/\/ search right\n        } else {\n            right = mid - 1 \/\/ search left\n        }\n    }\n    \n    return -1 \/\/ return -1 if not found\n}\n<\/code><\/pre>\n<h2>Problem Solving Process<\/h2>\n<p>Now let&#8217;s apply the binary search algorithm using the example provided in the problem.<\/p>\n<h3>Example Analysis<\/h3>\n<pre><code>\narr = [1, 2, 3, 4, 5, 6, 7, 8, 9]\ntarget = 5\n<\/code><\/pre>\n<p>The starting index for the binary search is 0, and the ending index is 8. Let&#8217;s calculate the middle index:<\/p>\n<pre><code>\nmid = left + (right - left) \/ 2\n   = 0 + (8 - 0) \/ 2\n   = 4\n<\/code><\/pre>\n<p>The value of arr[4] is 5. Since it matches the target value, we return index 4.<\/p>\n<h2>Performance Analysis<\/h2>\n<p>The time complexity of binary search is O(log n). This is because the search range is halved with each comparison; for example, if there are 8 elements in the array, it can be found in 3 comparisons. Binary search is very efficient for searching through a large amount of data.<\/p>\n<h2>Conclusion<\/h2>\n<p>In this course, we learned the concept of the binary search algorithm and how to implement it in Kotlin. This algorithm is useful for effectively finding specific values in a sorted array. When solving algorithm problems, it is important to understand the problem and choose the appropriate algorithm.<\/p>\n<p>Practice solving more problems and improving your algorithm skills!<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hello! In this course, we will explore the binary search algorithm, which commonly appears in job-related algorithm tests, and I will explain in detail how to solve problems using Kotlin. Binary search is an efficient algorithm for finding a specific value in a sorted array, with a time complexity of O(log n). In this course, &hellip; <a href=\"https:\/\/atmokpo.com\/w\/35098\/\" class=\"more-link\">\ub354 \ubcf4\uae30<span class=\"screen-reader-text\"> &#8220;Kotlin coding test course, binary search&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[106],"tags":[],"class_list":["post-35098","post","type-post","status-publish","format-standard","hentry","category----en"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8<\/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:\/\/atmokpo.com\/w\/35098\/\" \/>\n<meta property=\"og:locale\" content=\"ko_KR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"Hello! In this course, we will explore the binary search algorithm, which commonly appears in job-related algorithm tests, and I will explain in detail how to solve problems using Kotlin. Binary search is an efficient algorithm for finding a specific value in a sorted array, with a time complexity of O(log n). In this course, &hellip; \ub354 \ubcf4\uae30 &quot;Kotlin coding test course, binary search&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/35098\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:35:27+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T12:44:27+00:00\" \/>\n<meta name=\"author\" content=\"root\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:site\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:label1\" content=\"\uae00\uc4f4\uc774\" \/>\n\t<meta name=\"twitter:data1\" content=\"root\" \/>\n\t<meta name=\"twitter:label2\" content=\"\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04\" \/>\n\t<meta name=\"twitter:data2\" content=\"2\ubd84\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"Kotlin coding test course, binary search\",\"datePublished\":\"2024-11-01T09:35:27+00:00\",\"dateModified\":\"2024-11-01T12:44:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/\"},\"wordCount\":344,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"Kotlin coding test\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/\",\"url\":\"https:\/\/atmokpo.com\/w\/35098\/\",\"name\":\"Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:35:27+00:00\",\"dateModified\":\"2024-11-01T12:44:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/35098\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/35098\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Kotlin coding test course, binary search\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/atmokpo.com\/w\/#website\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/atmokpo.com\/w\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"ko-KR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"contentUrl\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"width\":400,\"height\":400,\"caption\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\"},\"image\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/x.com\/bebubo4\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\",\"name\":\"root\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"caption\":\"root\"},\"sameAs\":[\"http:\/\/atmokpo.com\/w\"],\"url\":\"https:\/\/atmokpo.com\/w\/author\/root\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","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:\/\/atmokpo.com\/w\/35098\/","og_locale":"ko_KR","og_type":"article","og_title":"Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"Hello! In this course, we will explore the binary search algorithm, which commonly appears in job-related algorithm tests, and I will explain in detail how to solve problems using Kotlin. Binary search is an efficient algorithm for finding a specific value in a sorted array, with a time complexity of O(log n). In this course, &hellip; \ub354 \ubcf4\uae30 \"Kotlin coding test course, binary search\"","og_url":"https:\/\/atmokpo.com\/w\/35098\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:35:27+00:00","article_modified_time":"2024-11-01T12:44:27+00:00","author":"root","twitter_card":"summary_large_image","twitter_creator":"@bebubo4","twitter_site":"@bebubo4","twitter_misc":{"\uae00\uc4f4\uc774":"root","\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04":"2\ubd84"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/atmokpo.com\/w\/35098\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/35098\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"Kotlin coding test course, binary search","datePublished":"2024-11-01T09:35:27+00:00","dateModified":"2024-11-01T12:44:27+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/35098\/"},"wordCount":344,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["Kotlin coding test"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/35098\/","url":"https:\/\/atmokpo.com\/w\/35098\/","name":"Kotlin coding test course, binary search - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:35:27+00:00","dateModified":"2024-11-01T12:44:27+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/35098\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/35098\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/35098\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"Kotlin coding test course, binary search"}]},{"@type":"WebSite","@id":"https:\/\/atmokpo.com\/w\/#website","url":"https:\/\/atmokpo.com\/w\/","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","description":"","publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/atmokpo.com\/w\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"ko-KR"},{"@type":"Organization","@id":"https:\/\/atmokpo.com\/w\/#organization","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","url":"https:\/\/atmokpo.com\/w\/","logo":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/","url":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","contentUrl":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","width":400,"height":400,"caption":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8"},"image":{"@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/x.com\/bebubo4"]},{"@type":"Person","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7","name":"root","image":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","caption":"root"},"sameAs":["http:\/\/atmokpo.com\/w"],"url":"https:\/\/atmokpo.com\/w\/author\/root\/"}]}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/35098","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/comments?post=35098"}],"version-history":[{"count":2,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/35098\/revisions"}],"predecessor-version":[{"id":38085,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/35098\/revisions\/38085"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=35098"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=35098"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=35098"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}