stacksort

Author: paurush11

Recursion/sort_a_stack.cpp

@@ -0,0 +1,100 @@
+// { Driver Code Starts
+
+/*
+Sort a stack
+Easy Accuracy: 50.51% Submissions: 46307 Points: 2
+Given a stack, the task is to sort it such that the top of the stack has the greatest element.
+
+Example 1:
+
+Input:
+Stack: 3 2 1
+Output: 3 2 1
+Example 2:
+
+Input:
+Stack: 11 2 32 3 41
+Output: 41 32 11 3 2
+Your Task:
+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. (The sorted stack is printed by the driver's code by popping the elements of the stack.)
+
+Expected Time Complexity : O(N*N)
+Expected Auixilliary Space : O(N) recursive.
+
+Constraints:
+1<=N<=100
+*/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+class SortedStack{
+public:
+	stack<int> s;
+	void sort();
+};
+
+void printStack(stack<int> s)
+{
+    while (!s.empty())
+    {
+        printf("%d ", s.top());
+       	s.pop();
+    }
+    printf("\n");
+}
+
+int main()
+{
+int t;
+cin>>t;
+while(t--)
+{
+	SortedStack *ss = new SortedStack();
+	int n;
+	cin>>n;
+	for(int i=0;i<n;i++)
+	{
+	int k;
+	cin>>k;
+	ss->s.push(k);
+	}
+	ss->sort();
+	printStack(ss->s);
+}
+}// } Driver Code Ends
+
+
+/*The structure of the class is
+class SortedStack{
+public:
+	stack<int> s;
+	void sort();
+};
+*/
+
+/* The below method sorts the stack s
+you are required to complete the below method */
+
+void insert(stack<int>&s, int x){
+    if(s.empty()||s.top()<x){
+        s.push(x);
+        return;
+    }
+    int y = s.top();
+    s.pop();
+    insert(s, x);
+    s.push(y);
+}
+void SortedStack :: sort()
+{
+   //Your code here
+   if(s.size() == 1){
+       return;
+   }
+   int x = s.top();
+   s.pop();
+   sort();
+   insert(s,x);
+}
+{"mode":"full","isActive":false}