{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2021-03-20--003","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"c670a2b9-f8e4-5578-922a-f11964e13f49","html":"

이진탐색

\n
public class BinarySearch {\n    public static void main(String[] args) {\n        int[] arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };\n \n        binarySearch(2, arr);\n    }\n \n    public static void binarySearch(int iKey, int arr[]) {\n        int mid;\n        int left = 0;\n        int right = arr.length - 1;\n \n        while (right >= left) {\n            mid = (right + left) / 2;\n \n            if (iKey == arr[mid]) {\n                System.out.println(iKey + \" is in the array with index value: \" + mid);\n                break;\n            }\n \n            if (iKey < arr[mid]) {\n                right = mid - 1;\n            } else {\n                left = mid + 1;\n            }\n \n        }\n    }\n}
","fields":{"tagSlugs":["/tags/이진탐색/"],"slug":"/algo/posts/2021-03-20--003"},"frontmatter":{"title":"[참고] 이진탐색","tags":["이진탐색"],"date":"2021-03-20","description":"이진탐색"}}},"pageContext":{"slug":"/algo/posts/2021-03-20--003"}},"staticQueryHashes":[]}