Commit f58d6c3

authored

Create Queue.c

1 parent 4da8aa5 commit f58d6c3Copy full SHA for f58d6c3

File tree

+44

-0

lines changed

+44

-0

lines changed

Lines changed: 44 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,44 @@`
	`1`	`+#include <stdio.h>`
	`2`	`+#define MAX 10`
	`3`	`+`
	`4`	`+typedef struct {`
	`5`	`+ int container[MAX];`
	`6`	`+ int front;`
	`7`	`+ int rear;`
	`8`	`+} queue;`
	`9`	`+`
	`10`	`+queue getNewQueue() {`
	`11`	`+ queue newQ;`
	`12`	`+ newQ.front = -1;`
	`13`	`+ newQ.rear = -1;`
	`14`	`+`
	`15`	`+ return newQ;`
	`16`	`+}`
	`17`	`+`
	`18`	`+void enqueue(queue* Q, int value) {`
	`19`	`+ Q->container[++Q->rear] = value;`
	`20`	`+}`
	`21`	`+`
	`22`	`+int dequeue(queue* Q) {`
	`23`	`+ if (Q->front == Q->rear) {`
	`24`	`+ printf("This Queue is empty, return value should be ignored.");`
	`25`	`+ return -1;`
	`26`	`+ }`
	`27`	`+`
	`28`	`+ return Q->container[++Q->front];`
	`29`	`+}`
	`30`	`+`
	`31`	`+int main(void) {`
	`32`	`+ queue q1 = getNewQueue();`
	`33`	`+`
	`34`	`+ for (int i = 0; i < 10; i++) {`
	`35`	`+ enqueue(&q1, i);`
	`36`	`+ printf("Enqueue : %d\n", i);`
	`37`	`+ }`
	`38`	`+`
	`39`	`+ for (int i = 0; i < 10; i++) {`
	`40`	`+ printf("Dequeue : %d\n", dequeue(&q1));`
	`41`	`+ }`
	`42`	`+`
	`43`	`+ return 0;`
	`44`	`+}`

Comments

(0)