Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
Answer:
D
Explanation:
because it is a administrative procedure
In a stack, if a user tries to remove an element from an empty stack it is called underflow.
<h3>What is underflow?</h3>
When we attempt to pop (remove) anything off the stack but there is nothing there to remove, stack underflow occurs. The computer will kind of sound an alert as a result of what we taught it to do, which is impossible.
The options are:
1) Underflow
2) Empty collection
3) Overflow
4) Garbage collection
As we know,
When an item is requested from the stack but the stack is empty, an error situation arises.
Thus, in a stack, if a user tries to remove an element from an empty stack it is called underflow.
Learn more about the underflow here:
brainly.com/question/14865058
#SPJ4
