Given a stack, the task is to sort it such that the top of the stack has the greatest element.
The first line of input will contains an integer T denoting the no of test cases . Then T test cases follow. Each test case contains an integer N denoting the size of the stack. Then in the next line are N space separated values which are pushed to the the stack.
For each test case output will be the popped elements from the sorted stack.
You don't have to read input or print anything. Your task is to complete the function sort() which sorts the elements present in the given stack.
Expected Time Complexity : O(N*N)
Expected Auixilliary Space : O(N) recursive.
Example(To be used only for expected output):
3 2 1
11 2 32 3 41
3 2 1
41 32 11 3 2
For first test case stack will be
When elements popped : 3 2 1
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.