Generation

generate functionMon, 15 May 2023

create a fifo to move data in an array

#include <iostream> using namespace std; // Function to create a circular queue of size n. void createQueue(int n) { // queue = (int *)malloc(n*sizeof(int)); queue = new int[n]; front = rear = -1; size = n; } // Function to insert an element in queue at // rear end void enqueue() { int ele; cout<<"Enter the element to be inserted in queue\n"; cin>>ele; if ((front == 0 && rear == size-1) || (rear == (front-1)%(size-1))) { cout<<"\nQueue is Full"; return; } else if (front == -1) /* Insert First Element */ { front = rear = 0; queue[rear] = ele; } else if (rear == size-1 && front != 0) { rear =

Questions about programming?Chat with your personal AI assistant