![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657608195152-Article.jpg\")
<\/p>\n<\/p>\n
Given a queue, we have to sort the queue using a recursive function<\/a> without using any loop. We can only use the standard functions for it:-<\/p>\n Queue follows the principle of FIFO (First in First out) i.e. element which is inserted first will be removed first. The operation for insertion of elements is known as enqueue operation and the operation for deletion of elements is known as dequeue operation. Like Stack, Queue is also a linear data structure.<\/p>\n Approach for sorting queue with the help of recursive function:<\/strong><\/p>\n The idea is to make the queue empty by holding all the elements in the function call stack. When the queue becomes empty, add all held elements one by one in sorted order<\/a>. In the time of insertion, sorted order is important.<\/p>\n Whenever you get the element from the function call stack, then first calculate the size of the queue and compare it with the elements of the queue. This will arises two cases:<\/p>\n\n
What is a queue?<\/h3>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657606447300-Image-02.png\")
<\/p>\nHow to manage sorted order?<\/h3>\n
\n