Find Minimum value from an Array By applying Divide and Conquer Algorithm.

#include <iostream>

using namespace std;

int min1;

void binary_search(int array[],int low,int high)

{

    if(low>=high)

    {

        return;

    }

    int mid = (low+high)/2;

    if(array[mid]<min1)

    {

        min1 = array[mid];

       // binary_search(array,low,mid);

    }

    if(array[mid]>min1)

    {

        binary_search(array,low,mid);

    }

    else

    {

        binary_search(array,mid+1,high);

    }

}

int main()

{

    int n,low,high;

    int array[100];

    cout<<"Enter Array Size: ";

    cin>>n;

    cout<<"Array Element: "<<endl;

    for(int i=0; i<n; i++)

    {

        cin>>array[i];

    }

     min1=array[0];

    binary_search(array,0,n/2);

    binary_search(array,n/2,n);

    cout<<"
Min: "<< min1<<endl;

    return 0;

}