Linear & Binary Search

 

#include <stdio.h>
int binary_search(int arr_sorted[], int size_sorted,
int element_sorted)
{
    int low, mid, high;
    low = 0;
    high = size_sorted - 1;
    while (low <= high)
    {
        mid = (low + high) / 2;
        if (arr_sorted[mid] == element_sorted)
        {
            return mid;
        }
        if (arr_sorted[mid] < element_sorted)
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    return -1;
}
int lenear_search(int arr_unsorted[], int size_unsorted,
int element_unsorted)
{
    for (int i = 0; i < size_unsorted; i++)
    {
        if (arr_unsorted[i] == element_unsorted)
        {
            return i;
        }
    }
    return -1;
}
int main()
{
    // Unsorted Array for Linear Search............
    int arr_unsorted[] = {1, 3, 8, 55, 7, 66, 9, 88, 2, 44, 6};
    int size_unsorted = sizeof(arr_unsorted) / sizeof(int);
    int element_unsorted;
    printf("Enter the Element for LINEAR SEARCH : ");
    scanf("%d", &element_unsorted);
    int searchun_index = lenear_search(arr_unsorted,
size_unsorted, element_unsorted);
    // Sorted Array for Binary Search............
    int arr_sorted[] = {1, 3, 8, 9, 10, 88, 99, 444, 666};
    int size_sorted = sizeof(arr_sorted) / sizeof(int);
    int element_sorted;
    printf("Enter the Element for BINARY SEARCH : ");
    scanf("%d", &element_sorted);
    int search_index = binary_search(arr_sorted,
size_sorted, element_sorted);
   
    printf("The element %d is present in LINEAR SEARCH in %d
index \n", element_unsorted, searchun_index);
    printf("The element %d is present in BINARY SEARCH in %d
index \n", element_sorted, search_index);
    return 0;
}