Functions for Array Operations

#include<Stdio.h>
int binarySearch(int arr[], int x, int low, int high) {
    while (low <= high) {
        int mid = (high + low) / 2;

        if (arr[mid] == x)
        return mid;

        if (arr[mid] < x)
        low = mid + 1;

        else
        high = mid - 1;
    }

    return 0;
}
int deletion(int *a,int n,int index)
{ 
    int i;
    for(i=index-1; i<n-1; i++)
        {
            a[i]=a[i+1];
            
        }
}
 
int insert(int arr[],int val)
{
  int k,i;
  for (k = 0; k<5 ;k++)
    if(val<arr[k])

    break;

  for (i = 4; i>=k;i--)
  {
    arr[i+1] = arr[i];

  }
  arr[k] = val;

  return(1);

}
int input(){
    int number;
    scanf("%d", &number);
    return(number);
}
void print(int arr[],int n){ 
    int i;
    for(i=0; i<n; i++)
    {
            
        printf("%d ",arr[i]);
    }
}

Driver Code main( )

int main(){
    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    int n = sizeof(arr)/sizeof(arr[0]);
    printf("The default functional array is : ");
    for (int i = 0; i < n; i++){
        
        printf("%d ", arr[i]);
    }
    printf("\\n");

MENU for Array Operations

printf("Choose the option you want to perform in an array: \\n");
    printf("1. Binary Search \\n");
    printf("2. Insertion \\n");
    printf("3. deletion \\n");
    int choice = input();

    switch(choice){
        case 1:{
            int x;
            printf("Enter the element to find : ");
            scanf("%d", &x);
            int result = binarySearch(arr, x, 0, n - 1);
            if (result == -1)
                printf("Not found");
            else
                printf("Element %d is found at index %d", x, result);
            }
        case 2:{
            int pos, i,x;
            int n = sizeof(arr)/sizeof(arr[0]);
            printf("Enter the element to insert : ");
            scanf("%d", &x);
                       
            printf("Enter the position to insert the element : ");
            scanf("%d", &pos);
            n++;
            for (i = n - 1; i >= pos; i--)
                arr[i] = arr[i - 1];
            arr[pos - 1] = x;
            for (i = 0; i < n; i++)
                printf("%d ", arr[i]);
            printf("\\n");
	        
        }
        case 3:{
            int i,index,new1;
            int n = sizeof(arr)/sizeof(arr[0]);
            printf("Enter position: ");           
            scanf("%d",&index);
            int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
            if(index<=n && index>0)
            {                
                printf("\\nbefore deletion  :");        
                print(arr,n);               
                deletion(arr, n, index);        
                printf("\\nafter deletion :");                
                print(arr, n-1);
            }
            
        }
    }

    return 0;
}