拆半查找的递归和非递归算法

关注

原创最新推荐文章于 2026-09-13 15:31:13 发布 1k 阅读 AI 写同款· GEO 优化 ›

Unity 2022.3.3 LTS + Visual Studio 2022：手把手教你复刻《吸血鬼幸存者》核心战斗（附完整项目源码）本文详细介绍了如何使用Unity 2022.3.3 LTS和Visual Studio 2022从零构建《吸血鬼幸存者》式战斗系统。通过图文开发教程，涵盖对象池优化、ECS架构雏形、2D物理碰撞控制等关键技术，帮助开发者高效复刻这款热门游戏的自动攻击与海量刷怪机制。阅读详情

#include <stdio.h>  

int binary_search(int x, int data[], int b, int e) 
{     
    int i;     
    while(b <= e)     
    { 	
        i = (b + e) / 2; 	
        if(data[i] == x) return i; 	
        if(data[i] < x)  	    
            b = i + 1; 	
        else 	    
            e = i - 1;		 	
    } 	
    return -1;	 
}  

int binary_search_recursion(int x, int data[], int b, int e) 
{     
    int i;     
    i = (b + e) / 2;     
    if(b > e) return -1;     
    if(data[i] != x)     
    { 	
        if(x < data[i]) 	    
            return binary_search_recursion(x, data, 0, i - 1); 	
        else 	    
            return binary_search_recursion(x, data, i + 1, e);     
    }     
    else         
        return i; 
}  

int main() 
{     
    int data[] = {1, 4, 5, 7, 9};     
    printf("%d /n", binary_search_recursion(9, data, 0, 4));     
    printf("%d /n", binary_search(9, data, 0, 4));     
    printf("%d /n", binary_search_recursion(90, data, 0, 4));     
    printf("%d /n", binary_search(89, data, 0, 4));     
    return 0; 
}