//
//  main.c
//  BinarySearch
//
//  Created by Zachary Mallicoat on 3/10/15.
//  Copyright (c) 2015 cghcapital. All rights reserved.
//

#include <stdio.h>

int main() {

    int array[5], min, max, middle, input;

    array[0]=0;
    array[1]=1;
    array[2]=2;
    array[3]=3;
    array[4]=4;

    min = 0;
    max = 4;
    middle = (min+max)/2;

    printf("Here is the array: \n%d, %d, %d, %d, %d\n", array[0], array[1], array[2], array[3], array[4]);

    printf("Enter a value to search\n");
    scanf("%d", &input);


    while( min <= max )
    {
        if ( array[middle] < input )
            min = middle + 1;
        else if ( array[middle] == input )
        {
            printf("%d found in array at %d.\n", input, middle+1);
            break;
        }
        else
            max = middle - 1;

        middle = (min + max)/2;
    }
    if ( min > max )
        printf("%d not in array\n", input);

    return 0;
}

    //Stretch goal maybe?
//    int min, max, array[200], amount, arraymass;
//
//    printf("Enter number of elements for the array\n");
//    scanf("%d", &amount);
//
//    printf("Enter %d elements", amount);
//
//    for (arraymass = 0; arraymass < amount; arraymass++);
//    scanf("%d", &array[arraymass]);
//
//    if (max < min) {
//        return -1;
//    }