• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Sort Stack in place

November 23, 2014 by Dhaval Dave

Question is to sort a Stack in place without using extra Stack or other Data Structure.Answer :
Basic solution which comes in mind is to pop all element and sort and push into Stack again.
but as we don’t have extra space or Data Structure to sort stack.
We need to use inplace sorting, and to do so we need to have all elements out of stack.
One way to do so is to use “Recursion” .
It will use internally memory stack to store recursion values. but we can implement without initializing extra stack or memory.

Logic :

1) Recursively call function and pop all data.
2) Once stack is empty, Push last data.
3) While pushing data into stack pop top data and check for order.
4) Recursively call Sort function again and Push data finally.

Code :

#include <iostream>
#include <stack>
using namespace std;

void StackSort(int nTop, stack<int>& S);
//Step1
void StackSortUtil(stack<int>& S)
{
    for(int i=0;i<S.size(); ++i)
{
int nTop = S.top();
S.pop();
StackSort(nTop, S);
}
}

void StackSort(int nTop, stack<int>& S)
{
//Step2
if(S.size() == 0)
{
S.push(nTop);
return;
}
//Step3
int nT = S.top();
if(nT > nTop)
{
int i = nTop;
nTop = nT;
nT = i;
}
//Step4
S.pop();
StackSort(nT,S);
S.push(nTop);
}
int printStack(stack <int>& S)
{
    while( ! S.empty()) {
        cout<< S.top() <<“n”;
        S.pop();
    }
}
int main()
{
std::stack<int> Stk;
Stk.push(10);
Stk.push(13);
Stk.push(41);
Stk.push(72);
Stk.push(15);

StackSortUtil(Stk);
        cout << “==Stack in decending order==n”;
        printStack(Stk);
return 0;
}
If you want to share such question , solution  or your experience of any company, Please do share at admin@gohired.in , As sharing is caring
http://ideone.com/cUS2sO

Similar Articles

Filed Under: Amazon Interview Question, Data Structure, problem

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Sort an array according to the order defined by another array

Possible sizes of bus to carry n groups of friends

System Design: Designing a LLD for Hotel Booking

Check if an array has duplicate numbers in O(n) time and O(1) space

Check Binary Tree is Binary Search Tree or not

Closed Parentheses checker

Memory Efficient LinkedList

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Maximum path sum between two leaves

Maximum difference between two elements s.t larger element appears after the smaller number

Facebook Interview Question : Interleave List

SAP Off Campus Hiring_ March 2015 Verbal Skills

Urban Ladder Written Test.

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

How strtok() Works

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Find Pythagorean Triplets in an array in O(N)

Count number of ways to reach a given score in a game

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Serialise Deserialise N-ary Tree

Print Power Set of a Set

BlueStone E-commerce Interview Experience

Test Cases for Round Function

Find Percentage of Words matching in Two Strings

VMWare SDEII Interview

ADOBE Aptitude C Language Test

Maximum size of square sub matrix with all 1’s in a binary matrix

Minimum insertions to form a palindrome

strtok()

Find loop in Singly linked list

Copyright © 2023 · Genesis Framework · WordPress · Log in