{"id":11045,"date":"2024-03-14T13:18:12","date_gmt":"2024-03-14T13:18:12","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/"},"modified":"2025-08-04T06:57:08","modified_gmt":"2025-08-04T06:57:08","slug":"how-to-use-the-binary-search-algorithm-in-c-to-find-a-number","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/","title":{"rendered":"Binary Search in C: Find Numbers Fast"},"content":{"rendered":"<p>Below is an example code that beautifully implements using the binary search method in the C programming language to find a number.<\/p>\n<pre class=\"post-pre\"><code><span class=\"hljs-meta\">#<span class=\"hljs-keyword\">include<\/span> <span class=\"hljs-string\">&lt;stdio.h&gt;<\/span><\/span>\r\n\r\n<span class=\"hljs-type\">int<\/span> <span class=\"hljs-title function_\">binarySearch<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> n, <span class=\"hljs-type\">int<\/span> target)<\/span> {\r\n    <span class=\"hljs-type\">int<\/span> left = <span class=\"hljs-number\">0<\/span>;\r\n    <span class=\"hljs-type\">int<\/span> right = n - <span class=\"hljs-number\">1<\/span>;\r\n    \r\n    <span class=\"hljs-keyword\">while<\/span> (left &lt;= right) {\r\n        <span class=\"hljs-type\">int<\/span> mid = left + (right - left) \/ <span class=\"hljs-number\">2<\/span>;\r\n        \r\n        <span class=\"hljs-keyword\">if<\/span> (arr[mid] == target) {\r\n            <span class=\"hljs-keyword\">return<\/span> mid;\r\n        } <span class=\"hljs-keyword\">else<\/span> <span class=\"hljs-keyword\">if<\/span> (arr[mid] &lt; target) {\r\n            left = mid + <span class=\"hljs-number\">1<\/span>;\r\n        } <span class=\"hljs-keyword\">else<\/span> {\r\n            right = mid - <span class=\"hljs-number\">1<\/span>;\r\n        }\r\n    }\r\n    \r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">-1<\/span>; <span class=\"hljs-comment\">\/\/ \u8fd4\u56de-1\u8868\u793a\u672a\u627e\u5230\u76ee\u6807\u6570<\/span>\r\n}\r\n\r\n<span class=\"hljs-type\">int<\/span> <span class=\"hljs-title function_\">main<\/span><span class=\"hljs-params\">()<\/span> {\r\n    <span class=\"hljs-type\">int<\/span> arr[] = {<span class=\"hljs-number\">2<\/span>, <span class=\"hljs-number\">4<\/span>, <span class=\"hljs-number\">6<\/span>, <span class=\"hljs-number\">8<\/span>, <span class=\"hljs-number\">10<\/span>, <span class=\"hljs-number\">12<\/span>, <span class=\"hljs-number\">14<\/span>, <span class=\"hljs-number\">16<\/span>, <span class=\"hljs-number\">18<\/span>};\r\n    <span class=\"hljs-type\">int<\/span> n = <span class=\"hljs-keyword\">sizeof<\/span>(arr) \/ <span class=\"hljs-keyword\">sizeof<\/span>(arr[<span class=\"hljs-number\">0<\/span>]);\r\n    <span class=\"hljs-type\">int<\/span> target = <span class=\"hljs-number\">10<\/span>;\r\n    \r\n    <span class=\"hljs-type\">int<\/span> result = binarySearch(arr, n, target);\r\n    \r\n    <span class=\"hljs-keyword\">if<\/span> (result != <span class=\"hljs-number\">-1<\/span>) {\r\n        <span class=\"hljs-built_in\">printf<\/span>(<span class=\"hljs-string\">\"\u76ee\u6807\u6570 %d \u627e\u5230\u5728\u7d22\u5f15 %d\\n\"<\/span>, target, result);\r\n    } <span class=\"hljs-keyword\">else<\/span> {\r\n        <span class=\"hljs-built_in\">printf<\/span>(<span class=\"hljs-string\">\"\u76ee\u6807\u6570 %d \u672a\u627e\u5230\\n\"<\/span>, target);\r\n    }\r\n    \r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">0<\/span>;\r\n}\r\n<\/code><\/pre>\n<p>You can pass the array and the target number to the binarySearch function and find the target number at the index position returned by the function. If the target number is not found, the function will return -1. In the example above, the target number 10 was found at index 3 in the array.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Below is an example code that beautifully implements using the binary search method in the C programming language to find a number. #include &lt;stdio.h&gt; int binarySearch(int arr[], int n, int target) { int left = 0; int right = n &#8211; 1; while (left &lt;= right) { int mid = left + (right &#8211; left) [&hellip;]<\/p>\n","protected":false},"author":10,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"categories":[1],"tags":[7899,3198,381,3721,14082],"class_list":["post-11045","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-algorithms","tag-binary-search","tag-c-programming","tag-code-examples","tag-search-techniques"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.5 (Yoast SEO v21.5) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Binary Search in C: Find Numbers Fast - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"Master binary search in C with step-by-step implementation &amp; example code to find numbers efficiently in sorted arrays.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Binary Search in C: Find Numbers Fast\" \/>\n<meta property=\"og:description\" content=\"Master binary search in C with step-by-step implementation &amp; example code to find numbers efficiently in sorted arrays.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-03-14T13:18:12+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-08-04T06:57:08+00:00\" \/>\n<meta name=\"author\" content=\"Jackson Davis\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:site\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Jackson Davis\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\"},\"author\":{\"name\":\"Jackson Davis\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350\"},\"headline\":\"Binary Search in C: Find Numbers Fast\",\"datePublished\":\"2024-03-14T13:18:12+00:00\",\"dateModified\":\"2025-08-04T06:57:08+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\"},\"wordCount\":81,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"keywords\":[\"algorithms\",\"binary search\",\"C++ Programming\",\"code examples\",\"search techniques\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\",\"name\":\"Binary Search in C: Find Numbers Fast - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-14T13:18:12+00:00\",\"dateModified\":\"2025-08-04T06:57:08+00:00\",\"description\":\"Master binary search in C with step-by-step implementation & example code to find numbers efficiently in sorted arrays.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Binary Search in C: Find Numbers Fast\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"name\":\"Silicon Cloud Blog\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\",\"name\":\"Silicon Cloud Blog\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"contentUrl\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"width\":1024,\"height\":1024,\"caption\":\"Silicon Cloud Blog\"},\"image\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\",\"https:\/\/twitter.com\/SiliCloudGlobal\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350\",\"name\":\"Jackson Davis\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g\",\"caption\":\"Jackson Davis\"},\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/jacksondavis\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Binary Search in C: Find Numbers Fast - Blog - Silicon Cloud","description":"Master binary search in C with step-by-step implementation & example code to find numbers efficiently in sorted arrays.","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:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/","og_locale":"en_US","og_type":"article","og_title":"Binary Search in C: Find Numbers Fast","og_description":"Master binary search in C with step-by-step implementation & example code to find numbers efficiently in sorted arrays.","og_url":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-14T13:18:12+00:00","article_modified_time":"2025-08-04T06:57:08+00:00","author":"Jackson Davis","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Jackson Davis","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/"},"author":{"name":"Jackson Davis","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350"},"headline":"Binary Search in C: Find Numbers Fast","datePublished":"2024-03-14T13:18:12+00:00","dateModified":"2025-08-04T06:57:08+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/"},"wordCount":81,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"keywords":["algorithms","binary search","C++ Programming","code examples","search techniques"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/","url":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/","name":"Binary Search in C: Find Numbers Fast - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-14T13:18:12+00:00","dateModified":"2025-08-04T06:57:08+00:00","description":"Master binary search in C with step-by-step implementation & example code to find numbers efficiently in sorted arrays.","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-to-use-the-binary-search-algorithm-in-c-to-find-a-number\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Binary Search in C: Find Numbers Fast"}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/blog\/#website","url":"https:\/\/www.silicloud.com\/blog\/","name":"Silicon Cloud Blog","description":"","publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.silicloud.com\/blog\/#organization","name":"Silicon Cloud Blog","url":"https:\/\/www.silicloud.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","contentUrl":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","width":1024,"height":1024,"caption":"Silicon Cloud Blog"},"image":{"@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/SiliCloudGlobal\/","https:\/\/twitter.com\/SiliCloudGlobal"]},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350","name":"Jackson Davis","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g","caption":"Jackson Davis"},"url":"https:\/\/www.silicloud.com\/blog\/author\/jacksondavis\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/11045","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=11045"}],"version-history":[{"count":2,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/11045\/revisions"}],"predecessor-version":[{"id":154812,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/11045\/revisions\/154812"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=11045"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=11045"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=11045"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}