zoukankan      html  css  js  c++  java
  • 折半查找

    条件: 必须是有序的元素队列

    目的:查找该元素队列中是否有该元素,查找成功(找到目标元素)返回元素位置,失败(左右边界出现交叉)返回-1

    int binsearch(int list[],int searchnum,int left,int right)
    {
    // search list[0]<=list[1]...<=list[n-1] for searchnum.
    // return its position if found otherwise return -1;
     int middle;
     while(left <= right){
      middle=(left+right)/2;
      switch(COMPARE(list[middle],searchnum)){
       case -1: left=middle+1; break;
       case 0: return middle;
       case 1: right=middle-1;
      }
     }
     return -1;    
    }

    递归调用

    int binsearch(int list[],int searchnum,int left,int right)
    {
     /*search list[0]<=list[1]...<=list[n-1] for searchnum.
     return its position if found otherwise return -1;*/
     printf(" lrm: %d %d ",left,right);
     printf(" lrm: %d %d ",list[left],list[right]);
     int middle;
     if(left <= right){
      middle=(left+right)/2;
      printf(" m ,middle: %d %d ",middle,list[middle]);
      switch(COMPARE(list[middle],searchnum)){
       case -1: return binsearch( list, searchnum, middle+1, right) ;
       case 0: return middle;
       case 1: return binsearch( list, searchnum, left, middle-1) ;
      }
     }
     return -1;    
    }

  • 相关阅读:
    记计账需求分析
    进度条07
    Runner站立会议03
    Runner站立会议02
    Runner站立会议01
    构建之法阅读笔记03
    团队成员介绍
    团队进展报告(1)
    今日事——Sprint计划会议
    团队开发——软件需求分析报告
  • 原文地址:https://www.cnblogs.com/hysz/p/7125501.html
Copyright © 2011-2022 走看看