From 388dbc1121b2b7a376888b65c946ba6ff87c8c67 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Wed, 18 Oct 2017 23:26:14 +0800
Subject: [PATCH] Update stack.md

---
 algorithms/stack.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/algorithms/stack.md b/algorithms/stack.md
index 0d0a2e30..063e3a64 100644
--- a/algorithms/stack.md
+++ b/algorithms/stack.md
@@ -6,4 +6,4 @@ Stack
 - Write an algorithm to determine if all of the delimiters in an expression are matched and closed.
   - E.g. `{ac[bb]}`, `[dklf(df(kl))d]{}` and `{[[[]]]}` are matched. But `{3234[fd` and `{df][d}` are not.
   - [Source](http://blog.gainlo.co/index.php/2016/09/30/uber-interview-question-delimiter-matching/)
-- Sort a stack in ascending order using recursion/using an additional stack.
+- Sort a stack in ascending order using an additional stack.