{"id":135431,"date":"2024-05-27T10:19:31","date_gmt":"2024-05-27T04:49:31","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135431"},"modified":"2024-05-27T10:19:31","modified_gmt":"2024-05-27T04:49:31","slug":"binary-search-in-dsa-using-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/","title":{"rendered":"Binary Search with Time Complexity in DSA using C++"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/ Program for Binary Search in Data Structure\r\n#include&lt;iostream&gt;\r\n#define clrscr() system(\"cls\")\r\nusing namespace std;\r\nclass Search\r\n{\r\n      public:\r\n      int binarySearch(int ar[],int n,int s);\r\n};\r\nint Search::binarySearch(int ar[],int n,int s)\r\n      {\r\n           int low,high,mid;\r\n           low=0;\r\n           high=n-1;\r\n           while(low&lt;=high)\r\n           {\r\n               mid=(low+high)\/2;\r\n               if(s==ar[mid])\r\n                    return 1;\r\n               else\r\n               if(s&gt;ar[mid])\r\n                  low=mid+1;\r\n               else\r\n               high=mid-1;   \r\n           }\r\n           return 0;\r\n      }\r\n      \r\nint main()\r\n{\r\n    int a[500],n,s,i,temp,j;\r\n    clrscr();\r\n    xyz:cout&lt;&lt;\"\\nEnter limit of array\";\r\n    cin&gt;&gt;n;\r\n    if(n&gt;500 || n&lt;0)   \r\n    {\r\n        cout&lt;&lt;\"\\nInvalid limit\";\r\n        goto xyz;\r\n    }\r\n    else\r\n    {\r\n        cout&lt;&lt;\"\\n Enter element in array\";\r\n        for(i=0;i&lt;n;i++)\r\n            cin&gt;&gt;a[i];\r\n        \/\/Sorting \r\n      for(i=0;i&lt;n;i++)\r\n      {\r\n            for(j=i+1;j&lt;n;j++)\r\n            {\r\n                if(a[j]&lt;a[i])\r\n                {\r\n                    temp=a[i];\r\n                    a[i]=a[j];\r\n                    a[j]=temp;\r\n                }\r\n          }\r\n      }\r\n      cout&lt;&lt;\"\\n Enter element for search\";\r\n      cin&gt;&gt;s;\r\n      Search S1;\r\n      if(S1.binarySearch(a,n,s)) \r\n          cout&lt;&lt;\"\\nSearching success\";\r\n      else\r\n         cout&lt;&lt;\"\\nSearching not success\";  \r\n  }\r\n   return 0; \r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/ Program for Binary Search in Data Structure #include&lt;iostream&gt; #define clrscr() system(&#8220;cls&#8221;) using namespace std; class Search { public: int binarySearch(int ar[],int n,int s); }; int Search::binarySearch(int ar[],int n,int s) { int&#46;&#46;&#46;<\/p>\n","protected":false},"author":86671,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[24483,32282,32265,32266,32249,32251,32250],"class_list":["post-135431","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-binary-search","tag-binary-search-in-dsa-using-c","tag-data-structures-using-c","tag-data-structures-with-c","tag-dsa-using-c","tag-dsa-using-c-practical","tag-dsa-using-c-program"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Binary Search with Time Complexity in DSA using C++ - DataFlair<\/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:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Binary Search with Time Complexity in DSA using C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Program for Binary Search in Data Structure #include&lt;iostream&gt; #define clrscr() system(&quot;cls&quot;) using namespace std; class Search { public: int binarySearch(int ar[],int n,int s); }; int Search::binarySearch(int ar[],int n,int s) { int&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-05-27T04:49:31+00:00\" \/>\n<meta name=\"author\" content=\"TechVidvan Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"TechVidvan Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Binary Search with Time Complexity in DSA using C++ - DataFlair","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:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Binary Search with Time Complexity in DSA using C++ - DataFlair","og_description":"Program 1 \/\/ Program for Binary Search in Data Structure #include&lt;iostream&gt; #define clrscr() system(\"cls\") using namespace std; class Search { public: int binarySearch(int ar[],int n,int s); }; int Search::binarySearch(int ar[],int n,int s) { int&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-27T04:49:31+00:00","author":"TechVidvan Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"TechVidvan Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"Binary Search with Time Complexity in DSA using C++","datePublished":"2024-05-27T04:49:31+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/"},"wordCount":11,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["Binary Search","binary search in dsa using c++","data structures using c++","data structures with c++","dsa using c++","dsa using c++ practical","dsa using c++ program"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/","url":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/","name":"Binary Search with Time Complexity in DSA using C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-27T04:49:31+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/binary-search-in-dsa-using-cpp\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using C++ Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-cpp-tutorials\/"},{"@type":"ListItem","position":3,"name":"Binary Search with Time Complexity in DSA using C++"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49","name":"TechVidvan Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","caption":"TechVidvan Team"},"description":"TechVidvan Team provides high-quality content &amp; courses on AI, ML, Data Science, Data Engineering, Data Analytics, programming, Python, DSA, Android, Flutter, full stack web dev, MERN, and many latest technology.","url":"https:\/\/data-flair.training\/blogs\/author\/test001\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135431","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/86671"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=135431"}],"version-history":[{"count":3,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135431\/revisions"}],"predecessor-version":[{"id":142572,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135431\/revisions\/142572"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135431"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135431"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135431"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}