c언어)선형탐색, 이진탐색 [수업]

#include <stdio.h>
int linsearch(int a[], int size, int target){
    for (int i = 0; i < size; i++){
        if (a[i] == target)
            return i;
    }
    return -1;
}
int binsearch(int a[], int size, int target){
    int left = 0, right= size, mid; 
    while (left <= right){
        mid = (left + right) / 2;
        if (a[mid] == target)
            return mid;
        else if (a[mid] > target)
            right = mid - 1;
        else
            left = mid + 1;
    }
    return -1;
}
int main(){
    int a[] = { 5, 12, 17 , 20, 23 ,26, 31 };
    printf("\n-------------------------------------Linear Search-----------------------");
    printf("\nNumber 5 index = %d", linsearch(a,7,5));
    printf("\nNumber 23 index = %d", linsearch(a, 7, 33));
    printf("\nNumber 26 index = %d", linsearch(a, 7, 26));
    printf("\n-------------------------------------Linear Search-----------------------");
    printf("\nNumber 5 index = %d", binsearch(a, 7, 5));
    printf("\nNumber 33 index = %d", binsearch(a, 7, 33));
    printf("\nNumber 26 index = %d", binsearch(a, 7, 26));
}