{"data":{"site":{"siteMetadata":{"title":"HOME | blackpudding","subtitle":"고생했어. 오늘도.","copyright":"© All rights reserved.","author":{"name":"William JO","github":"blackpudding96"},"disqusShortname":"blackpudding","url":"https://blackpudding.netlify.com"}},"markdownRemark":{"id":"fedbb029-f3a1-599e-aca1-99a8e1239a9c","html":"

Binary Search(이진 탐색)

\n

Binary Search(이진 탐색)이란?

\n\n

Binary Search(이진 탐색) 구현

\n

Binary Search(이진 탐색)은 Recursive(재귀) 또는 Iterative(반복) 으로 구현 가능하다. 보편적으로 재귀보다는 반복문이 스택으로 인한 오버헤드가 없어서 더 선호되는 편이다.

\n

Binary Search(이진 탐색) Iterative(반복) 구현 코드 (C++)

\n
#include <iostream>\n\nint binary_search_iterative(int* arr, const int& length, const int& value) {\n\tif (arr == nullptr || length < 0)\n\t\treturn -1;\n\t\n\tint left = 0, right = length - 1, mid;\n\t\n\twhile (left <= right) {\n\t\tmid = left + ((right - left) / 2);\n\t\t\n\t\tif (arr[mid] == value)\n\t\t\treturn mid;\n\t\telse\n\t\t\tarr[mid] > value ? right = mid - 1 : left = mid + 1;\n\t}\n\t\n\treturn -1;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(NULL); \n\tstd::cout.tie(NULL);\n\t\n\tint nums[13] = {1, 3, 5, 7, 9, 45, 55, 66, 77, 122, 133, 1444 ,15555};\n\t\n\tstd::cout << binary_search_iterative(nums, 0, 12, 5) << std::endl;\n\t\n\treturn 0;\n}
\n

Binary Search(이진 탐색) Recursive(재귀) 구현 코드 (C++)

\n
#include <iostream>\n\nint binary_search_recursive(int* arr, const int& left, const int& right, const int& value) {\n\tif (left > right)\n\t\treturn -1;\n\n\tint mid = left + ((right - left) / 2);\n\t\n\tif(arr[mid] == value)\n\t\treturn mid;\n\telse\n\t\tarr[mid] > value ? binary_search_recursive(arr, left, mid - 1, value) : binary_search_recursive(arr, mid + 1, left, value);\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(NULL); \n\tstd::cout.tie(NULL);\n\t\n\tint nums[13] = {1, 3, 5, 7, 9, 45, 55, 66, 77, 122, 133, 1444 ,15555};\n\t\n\tstd::cout << binary_search_recursive(nums, 0, 12, 5) << std::endl;\n\t\n\treturn 0;\n}
\n

References

\n

https://anster.tistory.com/152
\nhttps://www.geeksforgeeks.org/binary-search/
\nhttps://ko.wikipedia.org/wiki/%EC%9D%B4%EC%A7%84%EA%B2%80%EC%83%89%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98
\nhttps://m.blog.naver.com/PostView.nhn?blogId=kks227&logNo=220403975420&proxyReferer=https:%2F%2Fwww.google.com%2F

\n
\n
\n
    \n
  1. \n

    https://blog.penjee.com/binary-vs-linear-search-animated-gifs/

    \n↩\n
    2. \n
\n
","fields":{"tagSlugs":["/tags/algorithm/"],"slug":"/posts/alogorithms/binary_search/"},"frontmatter":{"title":"[알고리즘] Binary Search(이진 탐색)","tags":["Algorithm"],"date":"2020-04-19","description":"Binary Search(이진 탐색)에 대해 알아보자."}}},"pageContext":{"slug":"/posts/alogorithms/binary_search/"}}