Find Array Element with Binary Search with Function.

#include<stdio.h>

int array[500];

int print(int array[],int n)

{

    int i;

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

    {

        printf("%d ",array[i]);

    }

    printf("
");

}

int sort(int array[],int n)

{

    int i,j,swap;

    for(i=0; i<n; i++) ///sorting part

    {

        for(j=0; j<n-i-1; j++)

        {

            if(array[j]>array[j+1])

            {

                swap = array[j];

                array[j] = array[j+1];

                array[j+1] = swap;

            }

        }

    }

}

int binary_search(int array[],int n)

{

    int i,m,first,last,flag=0;

    printf("Your Array: 
");

    print(array,n);///call print function for print the array

    printf("Please Enter The Element You Want to Search: ");

    scanf("%d",&m);

    first = 0;

    last = n-1;

    while(last>=first)

    {

        int mid = (first+last)/2;

        if(array[mid] == m)

        {

            flag=1;

            break;

        }

        else if(array[mid]>m)

        {

            last= mid-1;

        }

        else if(array[mid]<m)

        {

            first = mid + 1;

        }

    }

    if(flag==1)

    {

        printf("
Found
");

    }

    else

    {

        printf("
Not Found
");

    }

}

int main()

{

    int i,n;

    printf("Please Enter Array Size: ");

    scanf("%d",&n);

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

    {

        array[i] = rand()%100; /// randomly n number of value will generate

    }

    sort(array,n); ///ascending order sorting function

    binary_search(array,n); ///call the function for searching

    printf("
");

    return 0;

}