Method sort

S-Stack/SortStack.cpp:53–68

void SortStack :: sort()
{
   priority_queue<int,vector<int>,greater<int>>pq;  // declaring min heap
 
    while(!st.empty())    // run the loop till the stack is not empty
    {
      pq.push(st.top());
      st.pop();
    }
    
    while(!pq.empty())    // run the loop till the min heap is not empty
    {
      st.push(pq.top());
       pq.pop();
    }
}