ArrayADT.c

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

struct Array {
    int *A;
    int size;
    int length;
};

void DisplayArray(struct Array arr) {
    printf("Elements of Array are ");
    for (int i = 0; i < arr.length; i++) {
        printf("%d", arr.A[i]);
        printf(" ");
    }
    printf("\n");
}

void insert(struct Array arr, int number, int index, int *length) {
    for (int i = arr.length; i > index; i--) {
        arr.A[i] = arr.A[i - 1];
    }
    arr.A[index] = number;
    *length = arr.length + 1;
}

void append(struct Array arr, int number, int *length) {
    arr.A[arr.length] = number;
    *length = arr.length + 1;
}

void deleteIndex(struct Array *arr, int index) {
    for (int i = index; i < arr -> length; i++) {
        arr->A[i] = arr->A[i+1]; 
    }
    arr->length = arr -> length - 1;
}

void swap(int *x, int *y) {
    int temp = *x;
    *x = *y;
    *y = temp;
}

void bubbleSort(struct Array *arr) {
    for (int i = 0; i < arr -> length - 1; i++) {
        for (int j = 0; j < arr -> length - 1 - i; j++) {
            if (arr -> A[j] > arr -> A[j+1]) {
                swap(&arr -> A[j], &arr -> A[j+1]);
            }
        }
    }
}

int checkIfSorted(struct Array *arr) {
    for (int i = 0; i < arr -> length - 1; i++) {
        if (arr -> A[i] > arr -> A[i+1]) 
            return -1;
    }
    return 1;
 }
 
 void insertInSorted(struct Array *arr, int number) {
    if (checkIfSorted(arr) == 1) {
        //arr -> A[arr->length] = number;
        int i = arr -> length - 1; // 7
        while (arr -> A[i] > number) {
            arr -> A[i+1] = arr -> A[i]; 
            i--;
        }
        arr -> A[i + 1] = number;
    }
    else {
        printf("Array not sorted");
    }
}

// void insertInSorted(struct Array *arr, int number) {
//     if (checkIfSorted(&arr) == 1) {
//         int i = arr -> length - 1;
//         while (arr -> A[i] > number) {
//             arr -> A[arr -> length] = arr -> A[i]; 
//         }
//     }
// }

int main() {
    struct Array arr;
    printf("Enter the size of Array ");
    scanf("%d", &arr.size);
    arr.A = (int *) malloc (arr.size * sizeof(int));
    arr.length = 0;

    int n;
    printf("Enter the no of elements you want to initialize ");
    scanf("%d", &n);

    printf("Enter the elements of Array ");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr.A[i]);
        printf(" ");
    }
    arr.length = n;
    
    DisplayArray(arr);
    
    insert(arr, 12, 4, &arr.length);
    
    DisplayArray(arr);
    
    append(arr, 52, &arr.length);
    
    DisplayArray(arr);

    deleteIndex(&arr, 5);
    
    DisplayArray(arr);

    insertInSorted(&arr, 9);
    
    bubbleSort(&arr);
    printf("Sorted Array \n");
    DisplayArray(arr);
    
    insertInSorted(&arr, 9);
    
    printf("After Inserting in Sorted Array \n");
    DisplayArray(arr);
}