#include <stdio.h>
#define MAX 1000000

int linearSearch(int *array,int n,int key)
{
    //best case0(1)ako elementot e na pocetok
    //worst case0(n)ako elementot e na kraj
    //complexity->0(n)
    int i;
    for(i=0;i<n;i++){
        if(array[i]=key)
            return i;
    }
    return -1;
}

int binarySearch(int *array,int n,int key)
{
    //bara nizata array da bide sortirana vo rastecki radolsed
    int start=0;
    int end=n-1;

    /*
    if(array[middle]==key)
        return middle;
    */
    while(start<=end)
    {
    int middle=(start+end)/2;
    if(array[middle]==key)
    {
        return middle;
    }
    else if(key<array[middle])
    {
    end=middle-1;
    }
    else
    {
    start=middle+1;
    }
    }
    return -1;
}
int main()
{
    int niza[MAX];
    int i;
    for(i=0;i<=MAX;i++)
    {
        niza[i-1]=i;
    }
    binarySearch(niza,MAX,991988);
    return 0;
}