Question

Given an integer k and a queue of integers, we need to reverse the order of the first k elements.without including stacks or queus as a library in c++

submit:

A header file containing the definition of the Queue class,

C++ file contains the implementation of the functions

C++file contains the main function to test the class

Answer 1

#include<bits/stdc++.h>
using namespace std;
void reverse(int a[20],int k,int p)
{ for(int i=0,j=k-1;i<=j;i++,j--)
{int t=a[i];
a[i]=a[j];
a[j]=t;}
cout<<"Array with reverse elements is"<<endl;
for(int i=0;i<p;i++)
cout<<a[i]<<" ";
}

int main()
{int k;int a[20];int p;int i;
cout<<"Enter the integer k"<<endl;
cin>>k;
cout<<"enter the no of elements in array"<<endl;
cin>>p;
cout<<"Enter the elements of queue"<<endl;
for(i=0;i<p;i++)
cin>>a[i];
reverse(a,k,p);
return 0;
}