TASK 1a wesja alpha

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

#define SIZE 5

typedef struct{

    int* data;//hold the adress of the dynbamin array
    int top;
    int size;
} Stack;

//void init(Stack* s);// return the base address of the stack after allocating the stack and also goinng to initilize the top and the size accordingly

Stack* init(int size);
void destroy(Stack* s);
void push(Stack *s, int element);
int pop(Stack* s);
int peep(Stack* s);
bool isEmpty(Stack* s);


int main( int argc, char const *argv[])
{
    Stack*s1 = init(SIZE);
    push(s1, 10);
    push(s1, 20);
    push(s1, 30);
    push(s1, 40);
    push(s1, 50);
    printf("Size of the stack: %d\n",s1->size);
    push(s1, 60);
    printf("Size of the stack: %d\n",s1->size);

    while(s1->top != -1)
    {
        printf("%d\n", pop(s1));
    }

    return 0;

}


Stack* init(int size)// when we want to construct stack
{
    Stack*s = (Stack*)malloc(sizeof(Stack));//constucting the stack
    if(s == '\0')// if malloc fails
    {
        printf(" Error -- Unalble to allocate memory , terminating the program\n");
        abort();
        //exit(1)
    }
    s->data = (int*)malloc(sizeof(int) * size);// initlize elements integer pointer data i base adress //allocation of the array for the stack
    if(s->data =='/0')
    {
        printf(" Error -- Unalble to allocate memory , terminating the program\n");
        abort();
        //exit(1)
    }
    s->top = -1;
    s->size = size;
    return s;

}

void push(Stack *s, int element)
{
    //cheak if array is overflowed or not
    //if aary is overflowed we need to double the size of the array
    if(s->top == s->size -1)// is overflowed
    {
        //double the size of the array
        int *temp = (int*)malloc(sizeof(int)* s->size * 2);
        if (temp == '\0') // we can not alocate no more space there
        {
            printf("Error -- Unalble to allocate memory... ");
            return;
        }
        //memory allocated succesfully
        int i = 0;
        for(i = 0; i <= s->top; ++i)// copying existing data to the data array on the new allocated array
        {
            temp[i] = s->data[i];
        }
        free(s->data);
        s->data = temp;
        s->size *= 2;
    }
    // if not ovcerflowed
    //top willl be increment by 1 fist and than that top will be index
    s->data[++s->top] = element; //this is the push operation incres the top by 1 and than put the value at the top index of the array
}

int pop(Stack* s)
{
    if(s->top == -1)//stack is underflowed = stack is empty
    {
        printf("Stack is empty");
        abort();
       // return -1001;
    }
    //get the value from the top and return this value/ decrement the top by 1
    else
    {
        return s->data[s->top--];
    }
}

int peep(Stack* s)
{
     if(s->top == -1)
    {
        printf("Stack is empty");
        abort();
       // return -1001;
    }
    else
    {
        return s->data[s->top];
    }
}