Queu_Array

#include<stdio.h>
#define sz 100

int arr[sz],last=0;

void Enqueue(int val)
{
    if(last>=sz)
        printf("No more space on Queue.\n");
    else
        arr[last++]=val;
}

void Dequeue()
{
    if(last<=0)
    {
        printf("Queue is empty\n");
    }
    else
    {
        printf("Removed element: %d\n",arr[0]);
        ///Shift All element left
        for(int i=1;i<last;i++)
            arr[i-1]=arr[i];
        last--;
    }
}

void printlist()
{
    int i;
    if(last<=0) printf("Queue is empty\n\n");

    else{
    printf("The Array is:");
    for(i=0;i<last;i++)
        printf("%d ",arr[i]);
     printf("\n\n");
    }
}

int main()
{
    int num,val;

    while(1)
    {
        printf("Enter your choice:\n");
        printf("1. Enqueue\n");
        printf("2. Dequeue\n");
        printf("3. Exit\n\n");
        scanf("%d",&num);

        if(num==1)
        {
                printf("Enter your Value:");
                scanf("%d",&val);

                Enqueue(val);

                printlist();
        }

        else if(num==2){
                Dequeue();

                printlist();
        }

        else{
                 break;
            }
    }

    return 0;
}