seaarching-binarySearch.c

#include <stdio.h>
#define s 1000

// Function to Swap 2 value Address
void swap(int *x, int *y)
{
    int temp = *x;
    *x = *y;
    *y = temp;
}

// Function for Bubble Sort Operations
void bubbleSort(int a[], int n){
    int i, j;

    for(i=0; i<n-1; ++i){
        for(j=0; j<n-i-1; ++j){
            if(a[j]>a[j+1]){
                swap(&a[j], &a[j+1]);
            }
        }
    }
}
// Function for binary search operation
void binarySearch(int a[], int n, int x){
    int i, count=0;
    bubbleSort(a,n);
    
    for(i=0; i<n; i++){
        int beg = i, end = n-1, mid = (beg+end)/2;
        while(beg<=end)
        {
            if(a[mid] > x){
                end = mid - 1;
                mid = (beg+end)/2;
            }
            else{
                beg = mid + 1;
                mid = (beg+end)/2;
            }

            if(a[mid] == x){
                count++;
            }
        }
    }
    if(count>0){
        printf("Value Matched\n");
    }
    else{
        printf("Value Not Found\n");
    }
}
int main()
{
    int n, a[s];
    scanf("%d", &n);

    for(int i=0; i<n; i++){
        scanf("%d", &a[i]);
    }

    int x;
    scanf("%d", &x);

    binarySearch(a,n,x);
}