如何分别使用递归与非递归实现二分查找算法

///非递归算法#include <stdio.h>int BinarySearch(int array[],int len,int findData){    if(array==NULL||len<= 0)        return -1;    int start = 0;    int end = len -1;    while(start<end){        int mid = (start + end)/2;        // int mid = start +(end-start)/2;        if(array[mid] == findData)            return mid;        else if(findData<array[mid])            end = mid -1;        else(findData>array[mid])            end = mid +1;    }    return -1;}//递归算法int BinarySearchRecursion(int array[],int len ,int findData){    if(array == NULL || len<= 0)        return -1;    int start = 0;    int end = len -1;    int mid = start+(end - start)/2;    if(array[mid]== findData)        return mid;    else if(array[mid]<findData)        return BinarySearchRecursion(array,mid-1,findData);    else(array[mid]>findData)        return BinarySearchRecursion(array,mid+1,findData);}