二分查找的简单实现.

最新推荐文章于 2022-11-23 23:28:15 发布

shizheng163

最新推荐文章于 2022-11-23 23:28:15 发布

阅读量221

点赞数

分类专栏：随笔

本文链接：https://blog.csdn.net/shizheng163/article/details/50897880

版权

随笔专栏收录该内容

41 篇文章 0 订阅

订阅专栏

数组必须有序且为线性结构.

int findNum(int a[],int first,int last,int target){
    if(first>=last)
        return -1;
    int mid = (last-first)/2+first;
    if(a[mid] == target)
        return mid;
    else{
        if(a[mid]>target)
            return findNum(a, first, mid-1, target);
        else
            return findNum(a, mid+1, last, target);
    }
}

<p class="p1"><span class="s1">int</span><span class="s2"> pos = </span><span class="s3">findNum</span><span class="s2">(a, </span><span class="s4">0</span><span class="s2">, </span><span class="s4">10</span><span class="s2">, </span><span class="s4">0</span><span class="s2">);</span></p><p class="p1"><span class="s2">    </span><span class="s1">if</span><span class="s2">(pos ==-</span><span class="s4">1</span><span class="s2">)</span></p><p class="p1"><span class="s2">        </span><span class="s5">printf</span><span class="s2">(</span><span class="s6">"</span><span class="s7">没找到</span><span class="s6">\n"</span><span class="s2">);</span></p><p class="p1"><span class="s2">    </span><span class="s1">else</span></p><p class="p1"><span class="s2">        </span><span class="s5">cout</span><span class="s2"><<a[pos]<<</span><span class="s5">endl</span><span class="s2">;</span></p>