Skip to content

Improved readiblity #21

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Improved readiblity #21

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
82 changes: 44 additions & 38 deletions Queue/DoubleEndedQueue.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,10 +6,10 @@ int a[20];

void enque_front(){
int ele;
printf("Enter the element");
printf("Enter the element: ");
scanf("%d",&ele);
if((front==0)&&(rear==MAX-1)||(rear+1)==front){
printf("Overflow");
printf("Overflow\n");
}
else if(front==-1&&rear==-1){
front=0;
Expand All @@ -30,11 +30,11 @@ void enque_front(){

void enque_rear(){
int ele;
printf("Enter the element");
printf("Enter the element: ");
scanf("%d",&ele);

if((front==0)&&(rear==MAX-1)||(rear+1)==front){
printf("Overflow");
printf("Overflow\n");
}
else if(front==-1&&rear==-1){
front=rear=0;
Expand All @@ -49,7 +49,7 @@ void enque_rear(){
void deque_rear(){ //rear
int item;
if((front==-1)&&(rear==-1)){
printf("Underflow");
printf("Underflow\n");
}
else if(front==rear){
item=a[rear];
Expand Down Expand Up @@ -82,47 +82,53 @@ void deque_front(){ //front
front=(front+1)%MAX;
}
}
void displayQueue(){
if(front==-1){
printf("Empty queue");
void displayQueue() {
if (front == -1) {
printf("The queue is empty.\n");
return;
}
printf("The queue is \n");
if(front<=rear){
for(int i=front;i<=rear;i++){
printf("%d\t",a[i]);
}
}else{
for(int i=front;i<MAX;i++){
printf("%d\t",a[i]);
}
for(int i=0;i<=rear;i++){
printf("%d\t",a[i]);
}
}

printf("\nQueue (Front to Rear):\n");
printf("Front -> ");

if (front <= rear) {
for (int i = front; i <= rear; i++) {
printf("%d, ", a[i]);
}
} else {
for (int i = front; i < MAX; i++) {
printf("%d, ", a[i]);
}
for (int i = 0; i <= rear; i++) {
printf("%d, ", a[i]);
}
}

printf("<- Rear\n");
}

void main()
{
int ch;

printf("Enter size");
printf("Enter size: ");
scanf("%d",&MAX);

do{
do{
printf("1.Insertion through Front- 2.Insertion through rear- 3.Deletion through front- 4.Deletion through rear 5.display \n");
scanf("%d",&ch);
switch(ch){
case 1:enque_front();
break;
case 2:enque_rear();
break;
case 3:deque_front();
break;
case 4:deque_rear();
break;
case 5:displayQueue();
break;
default:printf("Invalid");
}
}while(ch==1||ch==2||ch==3||ch==4||ch==5);
scanf("%d",&ch);
switch(ch){
case 1:enque_front();
break;
case 2:enque_rear();
break;
case 3:deque_front();
break;
case 4:deque_rear();
break;
case 5:displayQueue();
break;
default:printf("Invalid");
}
}while(ch>0 && ch<6);
}