Array.c

//4
#include <stdio.h>
#include <stdlib.h>


void read(int*arr,int n){
    printf("Enter the elements of the array:\n");
    for(int i=0;i<n;i++){
        scanf("%d",(arr+i));
    }
}

void display(int*arr,int n){
    printf("ARRAY:\n");
    for(int i=0;i<n;i++){
        printf("%d\t",*(arr+i));
    }
    printf("\n");
}

void insert_pos(int**arr,int*n){
    int pos;
    printf("Enter position to insert: ");
    scanf("%d",&pos);
    if(pos<1 || pos>*n+1){
        printf("Invalid position!\n");
        return;
    }
    int val;
    printf("Enter value to insert: ");
    scanf("%d",&val);

    int*newarr=(int*)realloc(*arr,(*n+1)*sizeof(int));
    if(newarr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    *arr=newarr;
    (*n)++;
    int i;
    for(i=*n-1;i>pos-1;i--){
        (*arr)[i]=(*arr)[i-1];
    }
    (*arr)[pos-1]=val;
}

void delete_pos(int**arr,int*n){
    int pos;
    printf("Enter position to delete: ");
    scanf("%d",&pos);
    if(pos<1 || pos>*n){
        printf("Inavalid position!\n");
        return;
    }
    for(int i=pos-1;i<*n-1;i++){
        (*arr)[i]=(*arr)[i+1];
    }
    int*newarr=(int*)realloc(*arr,(*n-1)*sizeof(int));
    if(newarr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    (*n)--;
    *arr=newarr;
}

void insert_key(int**arr,int*n){
    int key;
    printf("Enter key to insert immediately after: ");
    scanf("%d",&key);
    int in=search(*arr,*n,key);
    if(in==-1){
        printf("Key-> %d to insert immediately after not found\n",key);
        return;
    }
    int val;
    printf("Enter value to insert: ");
    scanf("%d",&val);

    int*newarr=(int*)realloc(*arr,(*n+1)*sizeof(int));
    if(newarr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    *arr=newarr;
    (*n)++;

    for(int i=*n-1;i>in+1;i--){
        (*arr)[i]=(*arr)[i-1];
    }
    (*arr)[in+1]=val;
}

int search(int*arr,int n,int key){
    for(int i=0;i<n;i++){
        if(arr[i]==key){
            return i;
        }
    }
    return -1;
}

void delete_key(int**arr,int*n){
    int key;
    printf("Enter the key to delete: ");
    scanf("%d",&key);

    int in = search(*arr,*n,key);
    if(in==-1){
        printf("Key-> %d to delete not found\n",key);
        return;
    }
    for(int i=in;i<*n-1;i++){
        (*arr)[i]=(*arr)[i+1];
    }
    int*newarr=(int*)realloc(*arr,(*n-1)*sizeof(int));
    if(newarr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    *arr=newarr;
    (*n)--;
}

void sort(int*arr,int n){
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n-i-1;j++){
            if(arr[j]>arr[j+1]){
                int temp=arr[j];
                arr[j]=arr[j+1];
                arr[j+1]=temp;
            }
        }
    }
}

void insert_order(int**arr,int*n){
    sort(*arr,*n);
    int val;
    printf("Enter the value to insert: ");
    scanf("%d",&val);

    int*newarr=(int*)realloc(*arr,(*n+1)*sizeof(int));
    if(newarr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    *arr=newarr;
    (*n)++;
    int in=(*n)-1;

    for(int i=*n-1;i>0;i--){
        if((*arr)[i-1]>val){
            (*arr)[i]=(*arr)[i-1];
            in=i-1;
        }
        else{
            break;
        }
    }
    (*arr)[in]=val;
}

void search_key(int*arr,int n){
    int key;
    printf("Enter key to search: ");
    scanf("%d",&key);
    int stat=search(arr,n,key);

    if(stat==-1){
        printf("\nSearch Unsuccessful!\nKey-> %d not found!\n",key);
        return;
    }

    printf("\nSearch Successful!\nKey-> %d found at position-> %d\n",key,stat+1);

}

void search_pos(int*arr,int n){
    int pos;
    printf("Enter the position to search: ");
    scanf("%d",&pos);
    if(pos<1||pos>n){
        printf("Invalid Position!\n");
        return;
    }

    printf("Value at position-> %d is: %d\n",pos,arr[pos-1]);
}

void reverse(int*arr,int n){
    for(int i=0;i<n/2;i++){
        int temp=arr[i];
        arr[i]=arr[n-i-1];
        arr[n-i-1]=temp;
    }
    printf("Successful Array Reversal...\n");
}

void main(){
    int n;
    printf("Enter the size of the array: ");
    scanf("%d",&n);
    int*arr=(int*)calloc(n,sizeof(int));
    if(arr==NULL){
        printf("Memory allocation failed...\n");
        return;
    }
    int ch;
    for(;;){
        printf("\nENTER:\n1. To Read\n2. To display\n3. To Insert By Position\n4. To Delete By Position\n5. To Insert by key\n6. To Delete By Key\n7. To Insert By Order\n8. To Search By Key\n9. To Search By Position\n10. To Reverse The Array\n");
        printf("Enter your choice from above: ");
        scanf("%d",&ch);

        switch (ch)
        {
        case 1:
        read(arr,n);
        break;

        case 2:
        display(arr,n);
        break;

        case 3:
        insert_pos(&arr,&n);
        break;

        case 4:
        delete_pos(&arr,&n);
        break;

        case 5:
        insert_key(&arr,&n);
        break;

        case 6:
        delete_key(&arr,&n);
        break;

        case 7:
        insert_order(&arr,&n);
        break;

        case 8:
        search_key(arr,n);
        break;

        case 9:
        search_pos(arr,n);
        break;

        case 10:
        reverse(arr,n);
        break;

        case 0:
        printf("Exiting...\n");
        free(arr);
        exit(0);

        default:
        printf("Invalid Choice! Please Enter Again!...\n");

        }
    }
}