Skip to content

Conversation

SumeetHaryani
Copy link
Contributor

Sort a stack with the help of a temporary stack.
Input:[1,10,21,3,9,-11,32]
Output:[32,21,10,9,3,1,-11]

@TheSTL
Copy link
Member

TheSTL commented Oct 13, 2019

@SumeetHaryani can you add time complexity for this problem?

@SumeetHaryani
Copy link
Contributor Author

@TheSTL I have added the time complexity #85

@TheSTL TheSTL merged commit 41fef14 into knaxus:master Oct 14, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants