title: what is the complexity of recursive linear search ( using divide and conquer technique )?
body: <p>wanted to analyse the complexity of recursive linear search ( using divide and conquer technique ). Is it log(n) or n ? if not log(n) then what is the actually complexity and how ?</p>
  
  <pre><code>int linear_search(int *a,int l,int h,int key){
      if(h == l){
          if(key == a[l])
              return l;
          else 
              return -1;
      }       
      int mid =(l+h)/2;
      int i = linear_search(a,l,mid,key);
      if(i == -1)
           i = linear_search(a,mid+1,h,key);
      return i; 
  }
  </code></pre>