二進位搜尋方法C++通用執行

來源:互聯網
上載者:User

標籤:

演算法很easy。直接附著到代碼它

 

#include <iostream>using namespace std;template<typename T>int binary_search(const T s[],const int size,const T &m){ if(size <= 0){  return -1; } int i = size/2; int k = 1; int step = 1; while(step > 0 && i >= 0 && i < size){  step = size/(2*++k);  if(m == s[i]){   return i;  }else if(m > s[i]){   i += step;  }else{   i -= step;  } } return -1;}int main(){ long s[]={1,3,5,6,19,27,38,45,687,6789,10000};  int len = sizeof(s)/sizeof(long); cout<<"0:"<<binary_search<long>(s,len,1)<<endl; cout<<"1:"<<binary_search<long>(s,len,3)<<endl; cout<<"5:"<<binary_search<long>(s,len,27)<<endl; cout<<"10:"<<binary_search<long>(s,len,10000)<<endl; cout<<"-1:"<<binary_search<long>(s,len,10001)<<endl; cout<<"-1:"<<binary_search<long>(s,len,44)<<endl; cout<<"-1:"<<binary_search<long>(s,len,0)<<endl; return 0;}


 

二進位搜尋方法C++通用執行

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.