Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
extra causes class UK assisment
//gcc 5.4.0 #include <stdio.h> int main(void) { printf("Hello, world!\n"); return 0; }https://play.google.com/store/apps/details?id=vrpatel0018.cprograms //Queue Data Structure #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAX_SIZE 100 int main() { int item, choice, i; int arr_queue[MAX_SIZE]; int rear = 0; int front = 0; int exit = 1; printf("\nSimple Queue Example - Array"); do { printf("\n\n Queue Main Menu"); printf("\n1.Insert \n2.Remove \n3.Display \nOthers to exit"); printf("\nEnter Your Choice : "); scanf("%d", &choice); switch (choice) { case 1: if (rear == MAX_SIZE) printf("\n## Queue Reached Max!!"); else { printf("\nEnter The Value to be Insert : "); scanf("%d", &item); printf("\n## Position : %d , Insert Value : %d ", rear + 1, item); arr_queue[rear++] = item; } break; case 2: if (front == rear) printf("\n## Queue is Empty!"); else { printf("\n## Position : %d , Remove Value : %d ", front, arr_queue[front]); front++; } break; case 3: printf("\n## Queue Size : %d ", rear); for (i = front; i < rear; i++) printf("\n## Position : %d , Value : %d ", i, arr_queue[i]); break; default: exit = 0; break; } } while (exit); return 0; }
run
|
edit
|
history
|
help
0
demo_strlen
c
Practica 5 fibonacci
Array Struct, Call-By-Reference, Malloc, Free, Init, Destroy ... Example
150108_RecursividadFibonacci
IndiSelSort
B_141107_Factorial
ptr_to_ptr
digitodentrodenumero
Project 5 v0.11